On Stateless Deterministic Restarting Automata

DOI10.1007/978-3-540-95891-8_33zbMath1206.68116OpenAlexW2145262891MaRDI QIDQ3599085

Hartmut Messerschmidt, Martin Kutrib, Friedrich Otto

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_33

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On CD-systems of stateless deterministic R-automata with window size one ⋮ New Results on Vector and Homing Vector Automata ⋮ Globally deterministic CD-systems of stateless R-automata with window size 1

Cites Work

• Succinct description of regular languages by weak restarting automata
• Growing context-sensitive languages and Church-Rosser languages
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Catalytic P systems, semilinear sets, and vector addition systems
• ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
• On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Stateless Deterministic Restarting Automata