Minimization of finite state automata through partition aggregation

DOI10.1007/978-3-319-53733-7_16MaRDI QIDQ5738999zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Aggregation-based minimization of finite state automata
• An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
• scientific article; zbMATH DE number 6300100
• scientific article; zbMATH DE number 4166871
• scientific article; zbMATH DE number 4108165

Cites work

• A uniform (bi-)simulation-based framework for reducing tree automata
• Backward and forward bisimulation minimization of tree automata
• Bisimulation Minimisation of Weighted Automata on Unranked Trees
• Bisimulation relations for weighted automata
• Efficiency of a Good But Not Linear Set Union Algorithm
• scientific article; zbMATH DE number 3511563 (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?)
• Incremental DFA minimisation
• Linear Automaton Transformations
• Minimizing nfa's and regular expressions
• Set Merging Algorithms
• Three Partition Refinement Algorithms

Cited in

(8)

• Minimization of Mealy finite-state machines by using the values of the output variables for state assignment
• Aggregation-based minimization of finite state automata
• Minimal separating sequences for all pairs of states
• A method for minimizing Moore finite-state machines by merging two states
• scientific article; zbMATH DE number 2081039 (Why is no real title available?)
• Implementation and Application of Automata
• Incremental NFA minimization
• An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions

This page was built for publication: Minimization of finite state automata through partition aggregation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738999)