Conjunctive grammars and systems of language equations

Programming and Computer Software

Volumn 28, Issue 5, 2002, Pages 243-249

  Okhotin, A S ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012884992     PISSN: 03617688     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020213411126     Document Type: Article

References (10)

1. Okhotin, A.S., On Augmenting the Formalism of Context-free Grammars with an Intersection Operation, Proc. of the IV Int. Conf. "Discrete Models in the Control System Theory," 2000, pp. 106-109.
2. Okhotin, A., Conjunctive Grammars, Pre-proceedings of DCAGRS 2000; Techn. report of Dept. of Computer Science, University of Western Ontario, London, Ontario, Canada, 2000, no. 555.
3. Okhotin, A., Conjunctive Grammars, J. Automata, Languages and Combinatorics, 2001, vol. 6, no. 4, pp. 519-535.
4. Okhotin, A., Top-Down Parsing of Conjunctive Languages, Grammars, 2002, vol. 5, no. 1, pp. 21-40.
5. Okhotin, A., A Recognition and Parsing Algorithm for Arbitrary Conjunctive Grammars, Theor. Comput. Sci. C, in press.
6. Okhotin, A., LR Parsing for Conjunctive Grammars, Grammars, 2002, vol. 5, no. 2, pp. 81-125.
7. Okhotin, A.S., On P-Completeness of the Membership Problem for Conjunctive Grammars, Proc. of the Int. Workshop on Discrete Mathematics and Mathematical Cybernetics, Ratmino, 2001.
8. Sudborough, I.H., A Note on Tape-bounded Complexity Classes and Linear Context-free Languages, J. ACM, 1975, vol. 22, no. 4, pp. 499-500.
9. Autebert, J., Berstel, J., and Boasson, L., Context-Free Languages and Pushdown Automata, in Handbook of Formal Languages, Berlin: Springer, 1997, vol. 1, pp. 111-174.
10. Kuich, W., Semirings and Formal Power Series: Their Relevance to Formal Language and Automata, in Handbook of Formal Languages, Berlin: Springer, 1997, vol. 1, pp. 609-677.