OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA

DOI10.1142/S0129054108005966zbMath1156.68031MaRDI QIDQ3526536

Martin Kutrib, Jens Reimann

Publication date: 25 September 2008

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

zbMATH Keywords

state complexityalternating finite automatafinite automata simulations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata ⋮ ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA ⋮ On Restarting Automata with Window Size One ⋮ Descriptional complexity of regular languages

Cites Work

• State-complexity of finite-state devices, state compressibility and incompressibility
• THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS

This page was built for publication: OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA