On the equivalence of linear conjunctive grammars and trellis automata

RAIRO - Theoretical Informatics and Applications

Volumn 38, Issue 1, 2004, Pages 69-88

  Okhotin, Alexander ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Cellular automaton; Conjunctive grammar; Language equation; Trellis automaton; Turing machine

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; INFORMATION ANALYSIS; MATHEMATICAL MODELS;

LINEAR CONJUNCTIVE GRAMMARS; TRELLIS AUTOMATA;

CONTEXT FREE LANGUAGES;

EID: 1642603396     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2004004     Document Type: Review

References (19)

1. J. Autebert, J. Berstel and L. Boasson, Context-Free Languages and Pushdown Automata. Handbook of Formal Languages 1 (1997) 111-174.
2. C. Choffrut and K. Culik II, On real-time cellular automata and trellis automata. Acta Inform. 21 (1984) 393-407.
3. N. Chomsky and M.P. Schützenberger, The algebraic theory of context-free languages. Computer programming and formal systems (1963) 118-161.
4. K. Culik II, J. Gruska and A. Salomaa, Systolic trellis automata (I, II). Int. J. Comput. Math. 15 (1984) 195-212; 16 (1984) 3-22; preliminary version in: Research Rep. CS-81-34, Dept. of Computer Sci., U. of Waterloo, Canada (1981).
5. K. Culik II, J. Gruska and A. Salomaa, Systolic trellis automata (I, II). Int. J. Comput. Math. 15 (1984) 195-212; 16 (1984) 3-22; preliminary version in: Research Rep. CS-81-34, Dept. of Computer Sci., U. of Waterloo, Canada (1981).
6. K. Culik II, J. Gruska and A. Salomaa, Systolic trellis automata (I, II). Int. J. Comput. Math. 15 (1984) 195-212; 16 (1984) 3-22; preliminary version in: Research Rep. CS-81-34, Dept. of Computer Sci., U. of Waterloo, Canada (1981).
7. K. Culik II, J. Gruska and A. Salomaa, Systolic trellis automata: stability, decidability and complexity. Inform. Control 71 (1986) 218-230.
8. C. Dyer, One-way bounded cellular automata. Inform. Control 44 (1980) 261-281.
9. O.H. Ibarra and S.M. Kim, Characterizations and computational complexity of systolic trellis automata. Theoret. Comput. Sci. 29 (1984) 123-153.
10. O.H. Ibarra, S.M. Kim and S. Moran, Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Comput. 14 (1985) 426-447.
11. A. Okhotin, Conjunctive grammars. J. Autom. Long. Comb. 6 (2001) 519-535; preliminary version in: Pre-proceedings of DCAGRS 2000, London, Ontario, Canada, July 27-29 (2000).
12. A. Okhotin, Conjunctive grammars. J. Autom. Long. Comb. 6 (2001) 519-535; preliminary version in: Pre-proceedings of DCAGRS 2000, London, Ontario, Canada, July 27-29 (2000).
13. A. Okhotin, Conjunctive grammars. and systems of language equations. Programming and Computer Software 28 (2002) 243-249.
14. A. Okhotin, On the closure properties of linear conjunctive languages. Theoret. Comput. Sci. 299 (2003) 663-685.
15. A. Okhotin, Whale Calf, a parser generator for conjunctive grammars, in Implementation and Application of Automata, Proc. CIAA 2002, Tours, France, July 3-5, 2002. Lect. Notes Comput. Sci. (2002). 2608 213-220.
16. A. Okhotin, Boolean grammars, in Developments in Language Theory, Proc. DLT 2003, Szeged, Hungary, July 7-11, 2003. Lect. Notes Comput. Sci. 2710 (2003) 398-410.
17. A.R. Smith III, Cellular automata and formal languages, in Proc. 11th IEEE Annual Sympo. Switching and Automata Theory (1970) 216-224.
18. A.R. Smith III, Real-time language recognition by one-dimensional cellular automata. J. Comput. Syst. Sci. 6 (1972) 233-252.
19. V. Terrier, On real-time one-way cellular array. Theoret. Comput. Sci. 141 (1995) 331-335.