Automata, Languages and Programming

DOI10.1007/11523468zbMath1082.68069OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716792

Jacques Sakarovitch, Sylvain Lombardy, Marie-Pierre Béal

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (18)

Coalgebras for Bisimulation of Weighted Automata over Semirings ⋮ Axiomatizing rational power series over natural numbers ⋮ Rational and Recognisable Power Series ⋮ Free inductive \(K\)-semialgebras ⋮ Bideterministic weighted automata ⋮ Bideterministic weighted automata ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Lexicographic decomposition of \(k\)-valued transducers ⋮ Bisimulations for weighted automata over an additively idempotent semiring ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Multi-Linear Iterative K-Σ-Semialgebras ⋮ Sequential? ⋮ Quantitative simulations by matrices ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Simulations of Weighted Tree Automata ⋮ Determinisability of unary weighted automata over the rational numbers ⋮ Equational theories for automata

This page was built for publication: Automata, Languages and Programming