Branching Measures and Nearly Acyclic NFAs
From MaRDI portal
Publication:5205046
DOI10.1142/S012905411940032XzbMath1427.68148OpenAlexW4234130960MaRDI QIDQ5205046
Publication date: 10 December 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905411940032x
Uses Software
Cites Work
- The tractability frontier for NFA minimization
- Cycle-aware minimization of acyclic deterministic finite-state automata
- Ambiguity and communication
- Descriptional and computational complexity of finite automata -- a survey
- On measuring nondeterminism in regular languages
- Finite automata and unary languages
- Amounts of nondeterminism in finite automata
- On the finite-valuedness problem for sequential machines
- On the degree of ambiguity of finite automata
- On the relation between ambiguity and nondeterminism in finite automata
- Numeration systems, linear recurrences, and regular sets
- Communication complexity method for measuring nondeterminism in finite automata
- Thin and slender languages
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
- Concise representations of regular languages by degree and probabilistic finite automata
- A Second Course in Formal Languages and Automata Theory
- Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
- State Complexity of Finite Tree Width NFAs
- Ambiguity, Nondeterminism and State Complexity of Finite Automata
- Depth-First Search and Linear Graph Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Branching Measures and Nearly Acyclic NFAs
