Morphisms and Minimisation of Weighted Automata

DOI10.3233/FI-222126MaRDI QIDQ5038573zbMATH OpenOpenAlexFDO

Authors Sylvain Lombardy, Jacques Sakarovitch

Publication date 7 October 2022

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2112.09387

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Two routes to automata minimization and the ways to reach it efficiently
• Bisimulation Minimisation for Weighted Tree Automata
• Weighted Bisimulation in Linear Algebraic Form
• Unweighted and weighted hyper-minimization
• Bisimulation Minimisation of Weighted Automata on Unranked Trees

Cites work

• A complete axiomatisation for observational congruence of finite-state behaviours
• An implementation of an efficient algorithm for bisimulation equivalence
• An Introduction to Symbolic Dynamics and Coding
• Bisimulation of automata
• Bisimulation through probabilistic testing
• Conjugacy and Equivalence of Weighted Automata and Functional Transducers
• Describing an algorithm by Hopcroft
• Efficient minimization of DFAs with partial transition
• Elements of automata theory. Translated from the French by Reuben Thomas
• Handbook of automata theory. Volume I. Theoretical foundations
• Handbook of weighted automata
• scientific article; zbMATH DE number 19761 (Why is no real title available?)
• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Implementation and Application of Automata
• Introduction to algorithms.
• On extremal cases of Hopcroft's algorithm
• Synchronized rational relations of finite and infinite words
• Three Partition Refinement Algorithms
• Two routes to automata minimization and the ways to reach it efficiently
• Weighted Bisimulation in Linear Algebraic Form

Cited in

(4)

• A Canonical Form for Weighted Automata and Applications to Approximate Minimization
• On the Complexity of Equivalence and Minimisation for Q-weighted Automata
• Explicit Hopcroft's trick in categorical partition refinement
• Multi-entry DFA with reduced initial states to speedup parallel recognition

This page was built for publication: Morphisms and Minimisation of Weighted Automata

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