Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols

DOI10.1007/978-3-319-98355-4_3zbMath1514.68106OpenAlexW2885335307MaRDI QIDQ6163616

Christos A. Kapoutsis

Publication date: 30 June 2023

Published in: Adventures Between Lower Bounds and Higher Altitudes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-98355-4_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On the Size of Two-Way Reasonable Automata for the Liveness Problem
• Nondeterminism and the size of two way finite automata
• Mathematical Foundations of Computer Science 2005
• DETERMINISM VS. NONDETERMINISM FOR TWO-WAY AUTOMATA: Representing the Meaning of States by Logical Formulæ
• Unnamed Item

This page was built for publication: Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols