On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages

DOI10.1007/978-3-319-13350-8_6zbMath1323.68341OpenAlexW61785131MaRDI QIDQ2944880

Alexander Okhotin, Juhani Karhumäki

Publication date: 8 September 2015

Published in: Computing with New Resources (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Approximate NFA universality and related problems motivated by information theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unambiguous finite automata over a unary alphabet
• Finite automata and unary languages
• Rational and affine expressions for image description
• Converting two-way nondeterministic unary automata into simpler automata.
• The complexity of compressing subsegments of images described by finite automata
• Finite automata, image manipulation, and automatic real functions
• Weighted Finite Automata: Computing with Different Topologies
• STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
• Finite Automata Computing Real Functions
• On continuous functions computed by finite automata
• Δ-Clearing Restarting Automata and $\makebox{\sf CFL} $
• Mathematical Foundations of Computer Science 2005
• On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY

This page was built for publication: On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages