Aggregation-based minimization of finite state automata

DOI10.1007/S00236-019-00363-5zbMATH Open1490.68125OpenAlexW2999586522WikidataQ126404744 ScholiaQ126404744MaRDI QIDQ2035006FDOQ2035006

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

Recommendations

• Minimization of finite state automata through partition aggregation
• Implementation and Application of Automata
• scientific article; zbMATH DE number 4108165
• scientific article; zbMATH DE number 6300100
• scientific article; zbMATH DE number 4166871

zbMATH Keywords

aggregationminimizationbisimulationbisimulation minimizationnondeterministic finite-state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Efficiency of a Good But Not Linear Set Union Algorithm
• Three Partition Refinement Algorithms
• Bisimulation relations for weighted automata
• Title not available (Why is that?)
• Backward and forward bisimulation minimization of tree automata
• A uniform (bi-)simulation-based framework for reducing tree automata
• Minimization of finite state automata through partition aggregation
• On the average complexity of Moore's state minimization algorithm
• Minimizing nfa's and regular expressions
• Linear Automaton Transformations
• Title not available (Why is that?)
• Set Merging Algorithms
• Average complexity of Moore's and Hopcroft's algorithms
• Incremental DFA minimisation
• Bisimulation Minimisation of Weighted Automata on Unranked Trees
• Title not available (Why is that?)

Cited In (10)

• Incremental NFA minimization
• The minimization of a kind of non-deterministic finite automata
• Two routes to automata minimization and the ways to reach it efficiently
• Minimization of Mealy finite-state machines by using the values of the output variables for state assignment
• Minimization of finite state automata through partition aggregation
• From generic partition refinement to weighted tree automata minimization
• Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification
• Implementation and Application of Automata
• Title not available (Why is that?)
• A method for minimizing Moore finite-state machines by merging two states

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

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