Aggregation-based minimization of finite state automata

DOI10.1007/S00236-019-00363-5MaRDI QIDQ2035006zbMATH OpenOpenAlexWikidataFDO

Authors Johanna Björklund, Loek Cleophas

Publication date 23 June 2021

Published in Acta Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

aggregationminimizationbisimulationbisimulation minimizationnondeterministic finite-state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cites work

• 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 6300101 (Why is no real title available?)
• scientific article; zbMATH DE number 3266653 (Why is no real title available?)
• A uniform (bi-)simulation-based framework for reducing tree automata
• Average complexity of Moore's and Hopcroft's algorithms
• 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
• Incremental DFA minimisation
• Linear Automaton Transformations
• Minimization of finite state automata through partition aggregation
• Minimizing nfa's and regular expressions
• On the average complexity of Moore's state minimization algorithm
• Set Merging Algorithms
• Three Partition Refinement Algorithms

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
• scientific article; zbMATH DE number 1213009 (Why is no real title available?)
• 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)