Unresolved systems of language equations: Expressive power and decision problems

Theoretical Computer Science

Volumn 349, Issue 3, 2005, Pages 283-308

  Okhotin, Alexander ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

Decision problems; Formal languages; Language equations

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DECISION SUPPORT SYSTEMS; LINEAR EQUATIONS; PROBLEM SOLVING; SET THEORY;

BOOLEAN OPERATIONS; DECISION PROBLEMS; LANGUAGE EQUATIONS; LINEAR CONCATENATION;

FORMAL LANGUAGES;

EID: 27844494750     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.038     Document Type: Article

References (27)

1. M. Arfi Opérations polynomiales et hiérarchies de concaténation Theoret. Comput. Sci. 91 1991 71 84
2. J. Autebert, J. Berstel, and L. Boasson Context-free languages and pushdown automata G. Rozenberg A. Salomaa Handbook of Formal Languages Vol. 1 1997 Springer Berlin 111 174
3. F. Baader, R. Küsters, Solving linear equations over regular languages, Proc. of the 15th Internat. Workshop on Unification, UNIF 2001, Siena, Italy, June 18-19, 2001, pp. 27-31.
4. F. Baader, R. Küsters, Unification in a description logic with transitive closure of rules, Working Notes of the 2001 Internat. Description Logics Workshop, DL 2001, Stanford, USA, August 1-3, 2001.
5. F. Baader, and P. Narendran Unification of concept terms in description logic J. Symbolic Comput. 31 2001 277 305
6. B.S. Baker, and R.V. Book Reversal-bounded multipushdown machines J. Comput. System Sci. 8 1974 315 332
7. J.A. Brzozowski, and E.L. Leiss On equations for regular languages, finite automata, and sequential networks Theoret. Comput. Sci. 10 1980 19 35
8. P. Cousot, and R. Cousot Constructive versions of Tarski's fixed point theorems Pacific J. Math. 82 1 1979 43 57
9. K. Culik II, J. Gruska, and A. Salomaa Systolic trellis automata, I and II Internat. J. Comput. Math. 15 1984 195 212 16 (1984) 3-22
10. S. Ginsburg, and H.G. Rice Two families of languages related to ALGOL J. ACM 9 1962 350 371
11. M. Harrison Introduction to Formal Language Theory 1978 Addison-Wesley Reading, MA
12. J. Hartmanis Context-free languages and Turing machine computations Proc. of Symposia in Applied Mathematics Vol. 19 1967 American Mathematical Society Providence, RI 42 51
13. J. Karhumäki, and I. Petre Conway's problem for three-word sets Theoret. Comput. Sci. 289 2002 705 725
14. L. Kari, and G. Thierrin Maximal and minimal solutions to language equations J. Comput. System Sci. 53 3 1996 487 496
15. M. Kunc, The power of commuting with finite sets of words, STACS 2005 (Stuttgart, Germany, February 24-26, 2005), LNCS 3404, pp. 569-580.
16. E.L. Leiss Language Equations 1999 Springer New York
17. A. Okhotin Conjunctive grammars J. Automata, Languages Combin. 6 4 2001 519 535
18. A. Okhotin Conjunctive grammars and systems of language equations Programming and Comput. Software 28 5 2002 243 249
19. A. Okhotin, Decision problems for language equations with Boolean operations, Automata, Languages Programming, Proc. of ICALP 2003, Eindhoven, The Netherlands, Lecture Notes in Computer Science, Vol. 2719, June 30-July 4, 2003, pp. 239-251.
20. A. Okhotin On the equivalence of linear conjunctive grammars to trellis automata Informatique Théorique Applications 38 1 2004 69 88
21. A. Okhotin Boolean grammars Inform. and Comput. 194 1 2004 19 48
22. A. Okhotin, Decision problems for language equations, submitted for publication.
23. J.-E. Pin Syntactic semigroups Rozenberg Salomaa Handbook of Formal Languages Vol. 1 1997 Springer Berlin 679 746
24. M.O. Rabin Decidability of second-order theories and automata on infinite trees Trans. Am. Math. Soc. 141 1969 1 35
25. A. Salomaa Theory of Automata 1969 Pergamon Press Oxford
26. S. Yu Regular Languages G. Rozenberg A. Salomaa Handbook of Formal Languages Vol. 1 1997 Springer Berlin 41 110
27. G.-Q. Zhang Domain mu-calculus Informatique Théorique Applications 37 2003 337 364