Efficient evaluation of nondeterministic automata using factorization forests
From MaRDI portal
Recommendations
Cited in
(6)- Oblivious DFA evaluation on joint input and its applications
- The factorisation forest theorem
- Efficient ambiguity detection in C-NFA. A step towards the inference of non deterministic automata
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
- A comparative study on three MAP factor estimate approaches for NFA
- Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations
This page was built for publication: Efficient evaluation of nondeterministic automata using factorization forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587404)