Converting finite width AFAs to nondeterministic and universal finite automata
From MaRDI portal
Publication:6131195
DOI10.1016/J.TCS.2024.114506OpenAlexW4392869357MaRDI QIDQ6131195FDOQ6131195
Authors: Mohammad Zakzok, Kai Salomaa 
Publication date: 4 April 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114506
Cites Work
- Alternation
- Descriptional and computational complexity of finite automata -- a survey
- Descriptional complexity of machines with limited resources
- Communication complexity method for measuring nondeterminism in finite automata
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
- Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Partial orders on words, minimal elements of regular languages, and state complexity
- An alternating hierarchy for finite automata
- Title not available (Why is that?)
- Alternating Pushdown and Stack Automata
- Ambiguity and communication
- Title not available (Why is that?)
- On measuring nondeterminism in regular languages
- On finite automata with limited nondeterminism
- Title not available (Why is that?)
- On the power of alternation in automata theory
- Existential and universal width of alternating finite automata
- Structural properties of NFAs and growth rates of nondeterminism measures
- Alternation in two-way finite automata
- State Complexity of Finite Tree Width NFAs
This page was built for publication: Converting finite width AFAs to nondeterministic and universal finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131195)
