An Automata-Theoretical Characterization of Context-Free Trace Languages
From MaRDI portal
Publication:3075533
DOI10.1007/978-3-642-18381-2_34zbMath1298.68152OpenAlexW23350029MaRDI QIDQ3075533
Publication date: 15 February 2011
Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_34
Related Items
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata, A survey on automata with translucent letters, State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters, Linear automata with translucent letters and linear context-free trace languages, On Restarting Automata with Window Size One
Cites Work
- Unnamed Item
- Unnamed Item
- Theory of traces
- Membership problems for regular and context-free trace languages
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
- COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA
- CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
- Developments in Language Theory