Morphisms and Minimisation of Weighted Automata

DOI10.3233/FI-222126OpenAlexW4225505315MaRDI QIDQ5038573

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synchronized rational relations of finite and infinite words
• Handbook of weighted automata
• An implementation of an efficient algorithm for bisimulation equivalence
• Bisimulation through probabilistic testing
• A complete axiomatisation for observational congruence of finite-state behaviours
• Two routes to automata minimization and the ways to reach it efficiently
• Bisimulation of automata
• On extremal cases of Hopcroft's algorithm
• Describing an algorithm by Hopcroft
• Weighted Bisimulation in Linear Algebraic Form
• Conjugacy and Equivalence of Weighted Automata and Functional Transducers
• Three Partition Refinement Algorithms
• An Introduction to Symbolic Dynamics and Coding
• Efficient Minimization of DFAs with Partial Transition Functions
• Implementation and Application of Automata
• Handbook of Automata Theory