State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata

DOI10.3233/FI-2011-540zbMath1234.68220OpenAlexW1816155648MaRDI QIDQ3100939

Alexander Okhotin, Michal Kunc

Publication date: 22 November 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2011-540

zbMATH Keywords

finite automatastate complexitytwo-way automatapartitions into sums of primes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Performing regular operations with 1-limited automata ⋮ From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods ⋮ State complexity of operations on two-way finite automata over a unary alphabet ⋮ On the state complexity of operations on two-way finite automata ⋮ State complexity of unambiguous operations on finite automata ⋮ State complexity of union and intersection on graph-walking automata

This page was built for publication: State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata