The hardest linear conjunctive language

Information Processing Letters

Volumn 86, Issue 5, 2003, Pages 247-253

  Okhotin, Alexander ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Computational complexity; Conjunctive grammars; Formal languages; Trellis automata

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; TRELLIS CODES;

LINEAR CONJUNCTIVE LANGUAGES;

FORMAL LANGUAGES;

EID: 0037545759     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00511-2     Document Type: Article

References (9)

1. Choffrut C., Culik K. II. On real-time cellular automata and trellis automata. Acta Inform. 21:1984;393-407.
2. Okhotin A. Conjunctive grammars. J. Automat. Languages Combin. 6:(4):2001;519-535.
3. A. Okhotin, A recognition and parsing algorithm for arbitrary conjunctive grammars, Theoret. Comput. Sci., to appear. doi: 10.1016/S0304-3975(02)00853-8.
4. Okhotin A. On the closure properties of linear conjunctive languages. Theoret. Comput. Sci. 299:2003;663-685.
5. A. Okhotin, Automaton representation of linear conjunctive languages, in: Developments in Language Theory, Proc. DLT 2002, Kyoto, Japan, Lecture Notes in Comput. Sci., Springer, Berlin, to appear.
6. A. Okhotin, A linear conjunctive grammar for the circuit value problem, Tech. Rept. 2002-460, School of Computing, Queen's University, Kingston, ON, 2002.
7. Papadimitriou Ch.H. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
8. Rytter W. On the recognition of context-free languages. 5th Symposium on Fundamentals of Computation Theory. Lecture Notes in Comput. Sci. 208:1985;315-322 Springer, Berlin.
9. Vollmer H. Introduction to Circuit Complexity: A Uniform Approach. 1999;Springer, Berlin.