Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
From MaRDI portal
Publication:2391861
DOI10.1007/s00236-012-0175-xzbMath1359.68177MaRDI QIDQ2391861
Publication date: 5 August 2013
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-012-0175-x
68Q45: Formal languages and automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On CD-systems of stateless deterministic R-automata with window size one
- Membership for growing context-sensitive grammars is polynomial
- Linear indexed languages
- Some decision problems about controlled rewriting systems
- Theory of traces
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
- Membership problems for regular and context-free trace languages
- Globally Deterministic CD-Systems of Stateless R(1)-Automata
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
- An Automata-Theoretical Characterization of Context-Free Trace Languages
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
- COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA
- CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
- ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
- Church-Rosser Thue systems and formal languages
- Restarting automata
- Models of Pushdown Automata with Reset
- Developments in Language Theory