Decision problems for language equations with Boolean operations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 239-251

  Okhotin, Alexander ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Boolean operations; Language equations; Recursive sets

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES;

ARITHMETICAL HIERARCHY; BOOLEAN OPERATIONS; DECISION PROBLEMS; EXISTENCE AND UNIQUENESS OF SOLUTION; LANGUAGE EQUATIONS; NONTRIVIAL PROPERTIES; RECURSIVE LANGUAGES; RECURSIVE SETS;

BOOLEAN ALGEBRA;

EID: 35248835505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_21     Document Type: Article

References (7)

1. J. Autebert, J. Berstel and L. Boasson, "Context-Free Languages and Pushdown Automata", Handbook of Formal Languages, Vol. 1, 111-174, Springer-Verlag, Berlin, 1997.
2. N. Immerman, Descriptive complexity, Springer-Verlag, New York, 1998.
3. W. Kuich, "Semirings and Formal Power Series: Their Relevance to Formal Language and Automata", Handbook of Formal Languages, Vol. 1, 609-677, Springer-Verlag, Berlin, 1997.
4. E. L. Leiss, Language equations, Springer-Verlag, New York, 1999.
5. A. Okhotin, "Conjunctive grammars", Journal of Automata, Languages and Combinatorics, 6:4 (2001), 519-535.
6. A. Okhotin, "Conjunctive grammars and systems of language equations", Programming and Computer Software, 28:5 (2002) 243-249.
7. Ch. H. Papadimitriou, Computational complexity, Addison-Wesley, 1994.