Boolean grammars

Information and Computation

Volumn 194, Issue 1, 2004, Pages 19-48

  Okhotin, Alexander ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Cellular automaton; Complement; Conjunctive grammar; Context free grammar; Intersection; Language equation; Parsing; Trellis automaton

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTABILITY AND DECIDABILITY; INFORMATION THEORY; INTERSECTIONS; QUERY LANGUAGES; TRELLIS CODES;

CELLULAR AUTOMATIONS; COMPLEMENT; CONJUNCTIVE GRAMMAR; CONTEXT-FREE GRAMMAR; LANGUAGE EQUATIONS; PARSING; TRELLIS AUTOMATIONS;

COMPUTATION THEORY;

EID: 4344640604     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.03.006     Document Type: Article

References (37)

1. A.V. Aho, Indexed grammars, Journal of the ACM 15 (4) (1968) 647-671.
2. J. Autebert, J. Berstel, L. Boasson, Context-free languages and pushdown automata, in: G. Rozenberg, A. Salomaain (Eds.), Handbook of Formal Languages, vol. I, Springer-Verlag, New York, 1997, pp. 111-174.
3. Y. Bar-Hillel, M. Perles, E. Shamir, On formal properties of simple phrase-structure grammars, Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung 14 (1961) 143-177.
4. P. Boullier, A cubic time extension of context-free grammars, Grammars 3 (2000) 111-131.
5. R.P. Brent, L.M. Goldschlager, A parallel algorithm for context-free parsing, Australian Computer Science Communications 6 (7) (1984) 7.1-7.10.
6. C. Choffrut, K. Culik II, On real-time cellular automata and trellis automata, Acta Informatica 21 (1984) 393-407.
7. N. Chomsky, M.P. Schützenberger, The algebraic theory of context-free languages, in: Braffort, Hirschberg (Eds.), Computer Programming and Formal Systems, North-Holland Publishing Company, Amsterdam, 1963, pp. 118-161.
8. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation 9 (3) (1990) 251-280.
9. K. Culik II, J. Gruska, A. Salomaa, Systolic trellis automata, I and II, International Journal of Computer Mathematics 15 (1984) 195-212, and 16 (1984) 3-22.
10. K. Culik II, J. Gruska, A. Salomaa, Systolic trellis automata, I and II, International Journal of Computer Mathematics 15 (1984) 195-212, and 16 (1984) 3-22.
11. K. Culik II, J. Gruska, A. Salomaa, Systolic trellis automata: stability, decidability and complexity, Information and Control 71 (1986) 218-230.
12. J. Dassow, Gh. Pǎun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.
13. M. Domaratzki, personal communication, February (2003).
14. G. Gazdar, Applicability of indexed grammars to natural languages, in: Reyle, Rohrer (Eds.), Natural Language Parsing and Linguistic Theories, D. Reidel Publishing Company, 1988, pp. 69-94.
15. S. Ginsburg, H.G. Rice, Two families of languages related to ALGOL, Journal of the ACM 9 (1962) 350-371.
16. O.K. Ibarra, S.M. Kim, Characterizations and computational complexity of systolic trellis automata, Theoretical Computer Science 29 (1984) 123-153.
17. N. Immerman, Descriptive complexity, Springer-Verlag, New York, 1998.
18. A.K. Joshi, L.S. Levy, M. Takahashi, Tree adjunct grammars, Journal of Computer and System Sciences 10 (1) (1975) 136-163.
19. A. Joshi, K. Vijay-Shanker, D. Weir, The convergence of mildly context-sensitive grammatical formalisms, in: Foundational Issues in Natural Language Processing, MIT Press, New York, 1991.
20. W. Kuich, Semirings and formal power series: their relevance to formal language and automata, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. I, Springer-Verlag, New York, 1997 pp. 609-677.
21. E.L. Leiss, Unrestricted complementation in language equations over a one-letter alphabet, Theoretical Computer Science 132 (1994) 71-93.
22. A. Okhotin, Conjunctive grammars, Journal of Automata, Languages and Combinatorics 6 (4) (2001) 519-535.
23. A. Okhotin, Conjunctive grammars and systems of language equations, Programming and Computer Software 28 (2002) 243-249.
24. A. Okhotin, Whale Calf, a parser generator for conjunctive grammars, Implementation and Application of Automata (Proceedings of CIAA 2002, Tours, France, July 3-5, 2002), LNCS 2608, 213-220.
25. A. Okhotin, On the closure properties of linear conjunctive languages, Theoretical Computer Science 299 (2003) 663-685.
26. A. Okhotin, Decision problems for language equations with Boolean operations, Automata, Languages and Programming (Proceedings of ICALP 2003, Eindhoven, The Netherlands, June 30-July 4, 2003), LNCS 2719, 239-251.
27. A. Okhotin, On the equivalence of linear conjunctive grammars to trellis automata, Informatique Théorique et Applications 38 (1) (2004) 69-88.
28. W.C. Rounds, LFP: a logic for linguistic descriptions and an analysis of its complexity, Computational Linguistics 14 (4) (1988) 1-9.
29. W.L. Ruzzo, On uniform circuit complexity, Journal of Computer and System Sciences 22 (3) (1981) 365-383.
30. W. Rytter, On the recognition of context-free languages, 5th Symposium on Fundamentals of Computation Theory (1985) LNCS 208, 315-322.
31. I.H. Sudborough, A note on tape-bounded complexity classes and linear context-free languages, Journal of the ACM 22 (4) (1975) 499-500.
32. V. Terrier, On real-time one-way cellular array, Theoretical Computer Science 141 (1995) 331-335.
33. [32] L.G. Valiant, General context-free recognition in less than cubic time, Journal of Computer and System Sciences 10 (1975) 308-315.
34. M. Vardi, Complexity of relational query languages, 14th Symposium on Theory of Computation (1982) 137-146.
35. K. Vijay-Shanker, D.J. Weir, The equivalence of four extensions of context-free grammars, Mathematical Systems Theory 27 (6) (1994) 511-546.
36. 3, Information and Control 10 (1967) 189-208.
37. S. Yu, Regular Languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. I, Springer-Verlag, New York, 1997, pp. 41-110.