State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet

DOI10.1007/978-3-642-22600-7_18zbMath1341.68099OpenAlexW1649246749MaRDI QIDQ5200094

Alexander Okhotin, Michal Kunc

Publication date: 29 July 2011

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22600-7_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Descriptional Complexity of Input-Driven Pushdown Automata, Unambiguous finite automata over a unary alphabet, Descriptional complexity of limited automata, State complexity of operations on two-way finite automata over a unary alphabet, On Simulation Cost of Unary Limited Automata

Cites Work

• Unnamed Item
• State complexity of operations on two-way finite automata over a unary alphabet
• The state complexity of \(L^{2}\) and \(L^k\)
• State complexity of power
• Finite automata and unary languages
• The state complexities of some basic operations on regular languages
• Complementing two-way finite automata
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• On the State Complexity of Operations on Two-Way Finite Automata
• The Maximum Order of an Element of a Finite Symmetric Group
• Unambiguous Finite Automata over a Unary Alphabet
• Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
• A Stronger Bertrand's Postulate with an Application to Partitions
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES