A recognition and parsing algorithm for arbitrary conjunctive grammars.
From MaRDI portal
Publication:1401337
DOI10.1016/S0304-3975(02)00853-8zbMATH Open1044.68081MaRDI QIDQ1401337FDOQ1401337
Authors: Alexander Okhotin 
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient context-free parsing algorithm
- Title not available (Why is that?)
- An Improved Context-Free Recognizer
- Title not available (Why is that?)
- Top-down parsing of conjunctive languages
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- Title not available (Why is that?)
- Space-bounded reducibility among combinatorial problems
Cited In (20)
- Improved normal form for grammars with one-sided contexts
- On the number of nonterminals in linear conjunctive grammars
- EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
- One-nonterminal conjunctive grammars over a unary alphabet
- The hardest linear conjunctive language
- Top-down parsing of conjunctive languages
- Title not available (Why is that?)
- \(LR(0)\) conjunctive grammars and deterministic synchronized alternating pushdown automata
- LR parsing for conjunctive grammars
- On the closure properties of linear conjunctive languages.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Title not available (Why is that?)
- Complexity of equations over sets of natural numbers
- Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
- Path querying with conjunctive grammars by matrix multiplication
- Conjunctive grammars and alternating pushdown automata
- Title not available (Why is that?)
- Recognizing two-sided contexts in cubic time
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
- Title not available (Why is that?)
This page was built for publication: A recognition and parsing algorithm for arbitrary conjunctive grammars.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401337)
