Hostname: page-component-77c89778f8-m42fx Total loading time: 0 Render date: 2024-07-23T04:28:30.586Z Has data issue: false hasContentIssue false
  • English
  • Français

On the equivalence of linear conjunctive grammars and trellis automata

Published online by Cambridge University Press:  15 March 2004

Alexander Okhotin
Alexander Okhotin*
Affiliation:
School of Computing, Queen's University, Kingston, Ontario, Canada; okhotin@cs.queensu.ca.
Get access

Abstract

This paper establishes computational equivalence of two seemingly unrelated concepts: linear conjunctive grammars and trellis automata. Trellis automata, also studied under the name of one-way real-time cellular automata, have been known since early 1980s as a purely abstract model of parallel computers, while linear conjunctive grammars, introduced a few years ago, are linear context-free grammars extended with an explicit intersection operation. Their equivalence implies the equivalence of several other formal systems, including a certain restricted class of Turing machines and a certain type of language equations, thus giving further evidence for the importance of the language family they all generate.

Keywords

Conjunctive grammartrellis automatoncellular automatonlanguage equationTuring machine.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 38 , Issue 1 , January 2004 , pp. 69 - 88
Copyright
© EDP Sciences, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Autebert, J., Berstel, J. and Boasson, L., Context-Free Languages and Pushdown Automata. Handbook of Formal Languages 1 (1997) 111-174. CrossRef
Choffrut, C. and Culik II, K., On real-time cellular automata and trellis automata. Acta Inform. 21 (1984) 393-407. CrossRef
N. Chomsky and M.P. Schützenberger, The algebraic theory of context-free languages. Computer programming and formal systems (1963) 118-161.
Culik II, K., Gruska, J. and Salomaa, A., 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). CrossRef
Culik II, K., Gruska, J. and Salomaa, A., Systolic trellis automata: stability, decidability and complexity. Inform. Control 71 (1986) 218–230. CrossRef
Dyer, C., One-way bounded cellular automata. Inform. Control 44 (1980) 261-281. CrossRef
Ibarra, O.H. and Kim, S.M., Characterizations and computational complexity of systolic trellis automata. Theoret. Comput. Sci. 29 (1984) 123-153. CrossRef
Ibarra, O.H., Kim, S.M. and Moran, S., Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Comput. 14 (1985) 426-447. CrossRef
Okhotin, A., Conjunctive grammars. J. Autom. Lang. Comb. 6 (2001) 519-535; preliminary version in: Pre-proceedings of DCAGRS 2000, London, Ontario, Canada, July 27-29 (2000).
Okhotin, A., Conjunctive grammars. and systems of language equations. Programming and Computer Software 28 (2002) 243-249. CrossRef
Okhotin, A., On the closure properties of linear conjunctive languages. Theoret. Comput. Sci. 299 (2003) 663-685. CrossRef
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.
Okhotin, A., Boolean grammars, in Developments in Language Theory, Proc. DLT 2003, Szeged, Hungary, July 7–11, 2003. Lect. Notes Comput. Sci. 2710 (2003) 398-410. CrossRef
A.R. Smith III, Cellular automata and formal languages, in Proc. 11th IEEE Annual Sympo. Switching and Automata Theory (1970) 216-224.
Smith III, A.R., Real-time language recognition by one-dimensional cellular automata. J. Comput. Syst. Sci. 6 (1972) 233-252. CrossRef
Terrier, V., On real-time one-way cellular array. Theoret. Comput. Sci. 141 (1995) 331-335. CrossRef