On the Size of Two-Way Reasonable Automata for the Liveness Problem

DOI10.1007/978-3-319-21500-6_9zbMath1386.68085OpenAlexW1122858939MaRDI QIDQ3451094

Maria Paola Bianchi, Juraj Hromkovič, Ivan Kováč

Publication date: 10 November 2015

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21500-6_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

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

Cites Work

• Finite automata and unary languages
• Lower bounds on the size of sweeping automata
• Two-way deterministic finite automata are exponentially more succinct than sweeping automata
• Converting two-way nondeterministic unary automata into simpler automata.
• Output consensus analysis and design for high-order linear swarm systems: partial stability method
• Size Complexity of Two-Way Finite Automata
• Linear Matrix Inequalities in System and Control Theory
• 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æ
• The determination of a local or almost local field from a given current
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Size of Two-Way Reasonable Automata for the Liveness Problem