On stateless deterministic restarting automata

DOI10.1007/S00236-010-0125-4zbMath1214.68198OpenAlexW2056734538MaRDI QIDQ611046

Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto

Publication date: 13 December 2010

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-010-0125-4

zbMATH Keywords

stateless automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata ⋮ On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata ⋮ Head and state hierarchies for unary multi-head finite automata ⋮ ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA ⋮ Reversibility for stateless ordered RRWW-automata ⋮ On Ordered RRWW-Automata ⋮ STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES ⋮ A NOTE ON LIMITED PUSHDOWN ALPHABETS IN STATELESS DETERMINISTIC PUSHDOWN AUTOMATA

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 Finite Automata and Multihead Pushdown 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