Globally deterministic CD-systems of stateless R-automata with window size 1

DOI10.1080/00207160.2012.688820zbMath1286.68293OpenAlexW2028695135MaRDI QIDQ2855753

Benedek Nagy, Friedrich Otto

Publication date: 22 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2437/128273

zbMATH Keywords

determinismrational trace languagerestarting automatonlanguage classcooperating distributed systemdeterministic finite-state acceptor with translucent letters

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata, Unnamed Item, Non-returning deterministic and nondeterministic finite automata with translucent letters, A survey on automata with translucent letters, State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters, Unnamed Item, Linear automata with translucent letters and linear context-free trace languages

Cites Work

• On CD-systems of stateless deterministic R-automata with window size one
• ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
• COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA
• On Stateless Deterministic Restarting Automata
• ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
• Unnamed Item
• Unnamed Item
• Unnamed Item