Minimization of Finite State Automata Through Partition Aggregation

DOI10.1007/978-3-319-53733-7_16zbMath1485.68134OpenAlexW2588532775MaRDI QIDQ5738999

Johanna Björklund, Loek Cleophas

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53733-7_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Aggregation-based minimization of finite state automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Backward and forward bisimulation minimization of tree automata
• Bisimulation relations for weighted automata
• Minimizing nfa's and regular expressions
• Linear Automaton Transformations
• Bisimulation Minimisation of Weighted Automata on Unranked Trees
• Three Partition Refinement Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• Incremental DFA minimisation
• A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
• Set Merging Algorithms

This page was built for publication: Minimization of Finite State Automata Through Partition Aggregation