State complexity of operations on two-way finite automata over a unary alphabet
From MaRDI portal
Publication:443746
DOI10.1016/J.TCS.2012.04.010zbMATH Open1255.68078OpenAlexW2095117965WikidataQ57380777 ScholiaQ57380777MaRDI QIDQ443746FDOQ443746
Authors: Michal Kunc, Alexander Okhotin 
Publication date: 13 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.010
Recommendations
- State complexity of operations on two-way deterministic finite automata over a unary alphabet
- On the state complexity of operations on two-way finite automata
- On the State Complexity of Operations on Two-Way Finite Automata
- State complexity of unambiguous operations on finite automata
- The state complexity of \(L^{2}\) and \(L^k\)
Cites Work
- The state complexities of some basic operations on regular languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Finite automata and unary languages
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Complementing two-way finite automata
- State complexity of power
- Title not available (Why is that?)
- The state complexity of \(L^{2}\) and \(L^k\)
- Optimal simulations between unary 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
- State complexity of operations on two-way deterministic finite automata over a unary alphabet
- Converting two-way nondeterministic unary automata into simpler automata.
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
- On the State Complexity of Operations on Two-Way Finite Automata
- Mathematical Foundations of Computer Science 2005
- A Stronger Bertrand's Postulate with an Application to Partitions
Cited In (16)
- On the State Complexity of Operations on Two-Way Finite Automata
- Title not available (Why is that?)
- Homomorphisms and inverse homomorphisms on graph-walking automata
- Descriptional complexity of limited automata
- State complexity of operations on two-way deterministic finite automata over a unary alphabet
- Investigations on automata and languages over a unary alphabet
- A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
- Homomorphisms on graph-walking automata
- Two-way unary automata versus logarithmic space
- On simulation cost of unary limited automata
- State complexity of unambiguous operations on finite automata
- Two-Way Unary Automata versus Logarithmic Space
- Simulations of unary one-way multi-head finite automata
- On the state complexity of operations on two-way finite automata
- Quantum finite automata: advances on Bertoni's ideas
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
This page was built for publication: State complexity of operations on two-way finite automata over a unary alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q443746)
