Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
From MaRDI portal
Publication:2391861
DOI10.1007/S00236-012-0175-XzbMATH Open1359.68177OpenAlexW2070193084MaRDI QIDQ2391861FDOQ2391861
Authors: Benedek Nagy, Friedrich Otto 
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
Recommendations
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
- CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- On CD-systems of stateless deterministic R-automata with window size one
- Globally deterministic CD-systems of stateless R-automata with window size 1
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On stateless two-pushdown automata and restarting automata
- Restarting automata
- Membership problems for regular and context-free trace languages
- Title not available (Why is that?)
- Membership for growing context-sensitive grammars is polynomial
- 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
- On CD-systems of stateless deterministic R-automata with window size one
- Theory of traces
- Linear indexed languages
- Title not available (Why is that?)
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some decision problems about controlled rewriting systems
- Developments in Language Theory
- Title not available (Why is that?)
- An Automata-Theoretical Characterization of Context-Free Trace Languages
- Globally deterministic CD-systems of stateless \(R(1)\)-automata
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
- Models of pushdown automata with reset
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
Cited In (7)
- CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
- On visibly pushdown trace languages
- Title not available (Why is that?)
- A survey on automata with translucent letters
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
- On properties of languages accepted by deterministic pushdown automata with translucent input letters
This page was built for publication: Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391861)
