Look-ahead on pushdowns
From MaRDI portal
DOI10.1016/0890-5401(87)90014-9zbMATH Open0625.68063OpenAlexW1995721258MaRDI QIDQ579952FDOQ579952
Authors: Joost Engelfriet, Heiko Vogler 
Publication date: 1987
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(87)90014-9
Recommendations
iterated pushdown automataiterated pushdown languagesLL(k) iterated indexed grammarslook-ahead on pushdowns
Cites Work
- Title not available (Why is that?)
- Top-down tree transducers with regular look-ahead
- Title not available (Why is that?)
- IO and OI. II
- Title not available (Why is that?)
- The IO- and OI-hierarchies
- An automata-theoretical characterization of the OI-hierarchy
- Title not available (Why is that?)
- Indexed Grammars—An Extension of Context-Free Grammars
- Nested Stack Automata
- Full AFLs and nested iterated substitution
- Some definitional suggestions for automata theory
- A Note on Pushdown Store Automata and Regular Systems
- On tree transducers for partial functions
- LR-regular grammars - an extension of LR(k) grammars
- Macro tree transducers
- Pushdown machines for the macro tree transducer
- The equivalence problem for LL- and LR-regular grammars
- LL-regular grammars
- A generalized approach to formal languages
- On LL-regular grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On deterministic indexed languages
- Ll-regular grammars
- Closure properties of deterministic indexed languages
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parsers for indexed grammars
- Parsing macro grammars top down
Cited In (11)
- A hierarchy of deterministic top-down tree transformations
- Top-down tree transducers with two-way tree walking look-ahead
- Storage-to-tree transducers with look-ahead
- Basic tree transducers
- \(X\)-automata on \(\omega\)-words
- Transducers and the decidability of independence in free monoids
- Rediscovering pushdown machines
- Effective Incorporation of Double Look-Ahead Procedures
- Iterated stack automata and complexity classes
- On store languages of language acceptors
- The structure of index sets and reduced indexed grammars
This page was built for publication: Look-ahead on pushdowns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579952)
