Title of article
PO LYNOMIAL LANGUAGES WITH FINITE ANTIDICTIONARI ES
Author/Authors
Shur، Arseny M. نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
11
From page
269
To page
279
Abstract
We tack le the p roblem of studyin g which kind of function scan o ccu r as c om p lex ity fu n c t ion s of form al lan gu ages of a cert ain ty p e.We p r ove t h at an im p ort ant n arrow s u b class of r at ion al lan gu ages c on -t ain s lan gu ages of p oly n om ial c om p lex ity of any int e ger d egree ove rany n on - t riv i al alp h ab e t
Keywords
finite antidictionary , combinatorial complexity , wed-like automaton , regular language
Journal title
RAIRO - Theoretical Informatics and Applications
Serial Year
2009
Journal title
RAIRO - Theoretical Informatics and Applications
Record number
666015
Link To Document