An Implementation of Deterministic Tree Automata Minimization

DOI10.1007/978-3-540-76336-9_13zbMath1139.68357OpenAlexW1544575850MaRDI QIDQ3503900

Mikel L. Forcada, Jan Daciuk, Rafael C. Carrasco

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_13

zbMATH Keywords

minimal deterministic tree automataminimization of automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Deciding top-down determinism of regular tree languages ⋮ Incremental construction of minimal tree automata ⋮ Minimisation of Multiplicity Tree Automata ⋮ From tree automata to string automata minimization ⋮ A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata

Cites Work

• An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
• Incremental construction of minimal tree automata
• Three Partition Refinement Algorithms
• The minimalization of tree automata
• Unnamed Item
• Unnamed Item

This page was built for publication: An Implementation of Deterministic Tree Automata Minimization