On computational universality in language equations

Lecture Notes in Computer Science

Volumn 3354, Issue , 2005, Pages 292-303

  Okhotin, R Alexander ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; RECURSIVE FUNCTIONS; SET THEORY; TURING MACHINES;

COMPUTATIONAL MODELS; COMPUTATIONAL UNIVERSALITY; LANGUAGE EQUATIONS; UNIVERSALITY;

COMPUTATIONAL METHODS;

EID: 24144451092     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31834-7_24     Document Type: Conference Paper

References (21)

1. J. Autebert, J. Berstel, L. Boasson, "Context-free languages and pushdown automata", in: Rozenberg, Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Springer-Verlag, Berlin, 1997, 111-174.
2. F. Baader, R. Küsters, "Solving linear equations over regular languages", Proceedings of the 15th International Workshop on Unification (UNIF 2001, June 18-19, 2001, Siena, Italy), 27-31.
3. B. S. Baker, R. V. Book, "Reversal-bounded multipushdown machines", Journal of Computer and System Sciences, 8 (1974), 315-332.
4. K. Culik II, J. Gruska, A. Salomaa, "Systolic trellis automata", I and II, International Journal of Computer Mathematics, 15 (1984), 195-212;
5. K. Culik II, J. Gruska, A. Salomaa, "Systolic trellis automata", International Journal of Computer Mathematics, 16 (1984), 3-22.
6. H. Fernau, "Nonterminal complexity of programmed grammars", Theoretical Computer Science, 296 (2003), 225-251;
7. also in MCU 2001.
8. S. Ginsburg, H. G. Rice, "Two families of languages related to ALGOL", Journal of the ACM, 9 (1962), 350-371.
9. L. Kari, G. Thierrin, "Maximal and minimal solutions to language equations", Journal of Computer and System Sciences, 53:3 (1996), 487-496.
10. J. Karhumäki, I. Petre, "Conway's problem for three-word sets", Theoretical Computer Science, 289 (2002), 705-725.
11. M. Kudlek, Yu. Rogozhin, "A Universal Turing Machine with 3 States and 9 Symbols", Developments in Language Theory (Proceedings of DLT 2001, Vienna, Austria, July 16-21, 2001), LNCS 2295, 311-318.
12. E. L. Leiss, Language equations, Springer-Verlag, New York, 1999.
13. A. Okhotin, "Conjunctive grammars", Journal of Automata, Languages and Combinatorics, 6:4 (2001), 519-535.
14. A. Okhotin, "Conjunctive grammars and systems of language equations", Programming and Computer Software, 28:5 (2002), 243-249.
15. A. Okhotin, "Decision problems for language equations with Boolean operations", Automata, Languages and Programming (ICALP 2003, Eindhoven, The Netherlands, June 30-July 4, 2003), LNCS 2719, 239-251; journal version submitted.
16. A. Okhotin, "On the equivalence of linear conjunctive grammars to trellis automata", Informatique Théorique et Applications, 38 (2004), 69-88.
17. A. Okhotin, "On the number of nonterminals in linear conjunctive grammars", Theoretical Computer Science, 320:2-3 (2004), 419-448.
18. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967.
19. A. Salomaa, Theory of Automata, Pergamon Press, Oxford, 1969.
20. N. Yevtushenko, T. Villa, R. K. Brayton, A. Petrenko, A. L. Sangiovanni-Vincentelli, "Solution of parallel language equations for logic synthesis", Proceedings of ICCAD 2001 (San Jose, CA, USA, November 4-8, 2001), 103-110.
21. G.-Q. Zhang, "Domain mu-calculus", Informatique Théorique et Applications, 37 (2003), 337-364.