Cycle-aware minimization of acyclic deterministic finite-state automata
From MaRDI portal
Publication:496535
Recommendations
Cites work
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 1033260 (Why is no real title available?)
- scientific article; zbMATH DE number 1962788 (Why is no real title available?)
- scientific article; zbMATH DE number 798342 (Why is no real title available?)
- scientific article; zbMATH DE number 3266653 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- Describing an algorithm by Hopcroft
- Incremental Construction of Minimal Acyclic Finite-State Automata
- Linear Automaton Transformations
- Minimisation of acyclic deterministic automata in linear time
- Re-describing an algorithm by Hopcroft
- \(fsm2\) --- A scripting language for creating weighted finite-state morphologies
Cited in
(4)
This page was built for publication: Cycle-aware minimization of acyclic deterministic finite-state automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496535)