Aggregation-based minimization of finite state automata

DOI10.1007/s00236-019-00363-5zbMath1490.68125OpenAlexW2999586522WikidataQ126404744 ScholiaQ126404744MaRDI QIDQ2035006

Johanna Björklund, Loek Cleophas

Publication date: 23 June 2021

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-019-00363-5

zbMATH Keywords

aggregationminimizationbisimulationnondeterministic finite-state automatabisimulation minimization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

From generic partition refinement to weighted tree automata minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average complexity of Moore's and Hopcroft's algorithms
• 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
• Minimization of Finite State Automata Through Partition Aggregation

This page was built for publication: Aggregation-based minimization of finite state automata