On the determinization blowup for finite automata recognizing equal-length languages
From MaRDI portal
Publication:2944880
DOI10.1007/978-3-319-13350-8_6zbMATH Open1323.68341OpenAlexW61785131MaRDI QIDQ2944880FDOQ2944880
Authors: Juhani Karhumäki, Alexander Okhotin 
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
Recommendations
- Deterministic blow-ups of minimal NFA's
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
- scientific article; zbMATH DE number 1156489
- Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite automata and unary languages
- Weighted finite automata: Computing with different topologies
- Finite Automata Computing Real Functions
- On continuous functions computed by finite automata
- Title not available (Why is that?)
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
- Unambiguous finite automata over a unary alphabet
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Converting two-way nondeterministic unary automata into simpler automata.
- Mathematical Foundations of Computer Science 2005
- Title not available (Why is that?)
- Rational and affine expressions for image description
- Finite automata, image manipulation, and automatic real functions
- The complexity of compressing subsegments of images described by finite automata
- \(\Delta \)-clearing restarting automata and CFL
- Title not available (Why is that?)
Cited In (5)
- Lengths of words accepted by nondeterministic finite automata
- Approximate NFA universality and related problems motivated by information theory
- Block languages and their bitmap representations
- Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language
- VC-dimensions of nondeterministic finite automata for words of equal length
This page was built for publication: On the determinization blowup for finite automata recognizing equal-length languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944880)
