On CD-systems of stateless deterministic R-automata with window size one

DOI10.1016/j.jcss.2011.12.009zbMath1279.68167OpenAlexW2014595465MaRDI QIDQ439938

Friedrich Otto, Benedek Nagy

Publication date: 17 August 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.12.009

zbMATH Keywords

closure propertyCD-systemrational trace languagerestarting automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata ⋮ 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 ⋮ Unnamed Item ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ Counter machines, Petri nets, and consensual computation ⋮ Globally deterministic CD-systems of stateless R-automata with window size 1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection and union of regular languages and state complexity
• Recent advances in formal languages and applications.
• ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
• COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA
• SHRINKING RESTARTING AUTOMATA
• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• On Stateless Deterministic Restarting Automata
• ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
• Church-Rosser Thue systems and formal languages
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Strictly Deterministic CD-Systems of Restarting Automata

This page was built for publication: On CD-systems of stateless deterministic R-automata with window size one