Decision problems for language equations

Journal of Computer and System Sciences

Volumn 76, Issue 3-4, 2010, Pages 251-266

  Okhotin, Alexander ^a,b  

^a ACADEMY OF FINLAND   (Finland)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

Boolean operations; Computability; Language equations

Indexed keywords

COMPUTER NETWORKS; SYSTEMS SCIENCE;

BOOLEAN OPERATIONS; COMPLETE PROBLEMS; COMPUTABILITY; DECISION PROBLEMS; LANGUAGE EQUATIONS; RECURSIVELY ENUMERABLE SETS; SOLUTION EXISTENCE; SOLUTION UNIQUENESS;

FORMAL LANGUAGES;

EID: 77950341186     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2009.08.002     Document Type: Article

References (23)

1. Aiken A., Kozen D., Vardi M.Y., and Wimmers E.L. The complexity of set constraints. Computer Science Logic. CSL 1993, Swansea, United Kingdom, September 13-17, 1993. Lecture Notes in Comput. Sci. vol. 832 (1994) 1-17
2. Autebert J., Berstel J., and Boasson L. Context-free languages and pushdown automata. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages, vol. 1 (1997), Springer 111-174
3. Baader F., and Narendran P. Unification of concept terms in description logic. J. Symbolic Comput. 31 3 (2001) 277-305
4. Baker B.S., and Book R.V. Reversal-bounded multipushdown machines. J. Comput. System Sci. 8 (1974) 315-332
5. Brzozowski J.A., and Leiss E.L. On equations for regular languages, finite automata, and sequential networks. Theoret. Comput. Sci. 10 (1980) 19-35
6. Charatonik W. Set constraints in some equational theories. Inform. and Comput. 142 1 (1998) 40-75
7. Conway J.H. Regular Algebra and Finite Machines (1971), Chapman and Hall
8. Daley M., Ibarra O.H., and Kari L. Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theoret. Comput. Sci. 306 (2003) 19-38
9. Ginsburg S., and Rice H.G. Two families of languages related to ALGOL. J. ACM 9 (1962) 350-371
10. Hartmanis J. Context-free languages and Turing machine computations. Proc. Sympos. Appl. Math. vol. 19 (1967), AMS 42-51
11. * c, with applications. Internat. J. Found. Comput. Sci. 14 (2003) 699-710
12. Karhumäki J., and Petre I. Conway's problem for three-word sets. Theoret. Comput. Sci. 289 (2002) 705-725
13. Kari L., and Konstantinidis S. Language equations, maximality and error-detection. J. Comput. System Sci. 70 (2005) 157-178
14. Kari L., and Thierrin G. Maximal and minimal solutions to language equations. J. Comput. System Sci. 53 3 (1996) 487-496
15. Kunc M. What do we know about language equations?. Developments in Language Theory. DLT 2007, Turku, Finland, July 3-6, 2007. Lecture Notes in Comput. Sci. vol. 4588 (2007) 23-27
16. Leiss E.L. Unrestricted complementation in language equations over a one-letter alphabet. Theoret. Comput. Sci. 132 (1994) 71-93
17. Okhotin A. Conjunctive grammars. J. Autom. Lang. Comb. 6 4 (2001) 519-535
18. Okhotin A. Conjunctive grammars and systems of language equations. Program. Comput. Software 28 5 (2002) 243-249
19. Okhotin A. Boolean grammars. Inform. and Comput. 194 1 (2004) 19-48
20. Rogers Jr. H. Theory of Recursive Functions and Effective Computability (1967), McGraw-Hill
21. Salomaa A. Theory of Automata (1969), Pergamon Press
22. Yevtushenko N., Villa T., Brayton R.K., Petrenko A., and Sangiovanni-Vincentelli A.L. Solution of parallel language equations for logic synthesis. International Conference on Computer-Aided Design. ICCAD 2001, San Jose, CA, USA, November 4-8, 2001 (2001), ACM 103-110
23. Zhang G.-Q. Domain mu-calculus. RAIRO Inf. Théor. Appl. 37 (2003) 337-364