scientific article; zbMATH DE number 3972192
From MaRDI portal
Publication:3738563
Recommendations
- Some algorithms for equivalent transformation of nondeterministic finite automata
- An algorithm for optimal representation of a nondeterministic finite automaton by a set-union knapsack problem
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- Cycle height of finite automata
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
Cited in
(12)- On input-revolving deterministic and nondeterministic finite automata
- The method of forced enumeration for nondeterministic automata
- A representable approach to finite nondeterminism
- scientific article; zbMATH DE number 1670710 (Why is no real title available?)
- An algorithm for optimal representation of a nondeterministic finite automaton by a set-union knapsack problem
- Run-Length Encoded Nondeterministic KMP and Suffix Automata
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- scientific article; zbMATH DE number 3982526 (Why is no real title available?)
- Some algorithms for equivalent transformation of nondeterministic finite automata
- scientific article; zbMATH DE number 809136 (Why is no real title available?)
- scientific article; zbMATH DE number 1445805 (Why is no real title available?)
- Cycle height of finite automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738563)
