Automata, Languages and Programming
From MaRDI portal
Publication:5716792
DOI10.1007/11523468zbMath1082.68069WikidataQ56656999 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
68Q70: Algebraic theory of languages and automata
Related Items
Rational and Recognisable Power Series, Multi-Linear Iterative K-Σ-Semialgebras, Coalgebras for Bisimulation of Weighted Automata over Semirings, Bideterministic weighted automata, Free inductive \(K\)-semialgebras, Bisimulations for fuzzy automata, Computation of the greatest simulations and bisimulations between fuzzy automata, Quantitative simulations by matrices, Nondeterministic automata: equivalence, bisimulations, and uniform relations, A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata, Lexicographic decomposition of \(k\)-valued transducers, Determinisability of unary weighted automata over the rational numbers, Equational theories for automata, Axiomatizing rational power series over natural numbers, Bisimulations for weighted automata over an additively idempotent semiring, Sequential?, Simulations of Weighted Tree Automata