From tree automata to string automata minimization
From MaRDI portal
Publication:722214
DOI10.1007/s00224-017-9815-4zbMath1400.68103OpenAlexW2757434222MaRDI QIDQ722214
Hadda Cherroun, Djelloul Ziadi, Bruce W. Watson, Younes Guellouma
Publication date: 23 July 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-017-9815-4
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- XML compression via directed acyclic graphs
- Fast brief practical DFA minimization
- Cycle-aware minimization of acyclic deterministic finite-state automata
- Backward and forward bisimulation minimization of tree automata
- A split-based incremental deterministic automata minimization algorithm
- Minimisation of acyclic deterministic automata in linear time
- A new algorithm for the construction of minimal acyclic DFAs.
- Parametric random generation of deterministic tree automata
- Incremental construction of minimal tree automata
- Incremental DFA Minimisation
- Pushing for Weighted Tree Automata
- COMPOSED BISIMULATION FOR TREE AUTOMATA
- An Implementation of Deterministic Tree Automata Minimization
- Three Partition Refinement Algorithms
- Incremental Construction and Maintenance of Minimal Finite-State Automata
- Incremental Construction of Minimal Acyclic Finite-State Automata
- Algebra automata I: Parallel programming as a prolegomena to the categorical approach
- The minimalization of tree automata
This page was built for publication: From tree automata to string automata minimization