CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store

DOI10.1051/ita/2011123zbMath1250.68172OpenAlexW1981000335MaRDI QIDQ3117547

Benedek Nagy, Friedrich Otto

Publication date: 28 February 2012

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222042

zbMATH Keywords

restarting automatoncooperating distributed systemcontext-free trace languageexternal pushdown

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata ⋮ A survey on automata with translucent letters ⋮ Linear automata with translucent letters and linear context-free trace languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of traces
• Membership problems for regular and context-free trace languages
• Combinatorial problems of commutation and rearrangements
• 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
• Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
• ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
• Notes on finite asynchronous automata
• Developments in Language Theory

This page was built for publication: CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store