Rational and Recognisable Power Series

DOI10.1007/978-3-642-01492-5_4zbMath1484.68110OpenAlexW1600043458MaRDI QIDQ5072546

Jacques Sakarovitch

Publication date: 28 April 2022

Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01492-5_4

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items

Coalgebras for Bisimulation of Weighted Automata over Semirings ⋮ Weighted Automata and Weighted Logics ⋮ Rational elements of summation semirings ⋮ On Power Series over a Graded Monoid ⋮ Why We Need Semirings in Automata Theory (Extended Abstract) ⋮ Polynomially ambiguous unary weighted automata over fields ⋮ Ambiguity Hierarchies for Weighted Tree Automata ⋮ Bideterministic weighted automata ⋮ The net automaton of a rational expression ⋮ Weighted Linear Dynamic Logic ⋮ Bideterministic weighted automata ⋮ Recognizability of the support of recognizable series over the semiring of the integers is undecidable ⋮ Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ Unnamed Item ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Determinisability of unary weighted automata over the rational numbers ⋮ Preservation of normality by transducers ⋮ On some decidability questions concerning supports of rational series ⋮ Context-free coalgebras ⋮ Hyper-optimization for deterministic tree automata ⋮ Ambiguity hierarchies for weighted tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Noncommutative minimization algorithms
• Partial derivatives of regular expressions and finite automaton constructions
• The equivalence problem for deterministic two-tape automata
• The equivalence problem of multitape finite automata
• On cancellation properties of languages which are supports of rational power series
• Complete systems of \(\mathcal B\)-rational identities
• Matrices de Hankel
• On some questions of rationality and decidability
• Derivatives of rational expressions with multiplicity
• Canonical derivatives, partial derivatives and finite automaton constructions.
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• Rational sets in commutative monoids
• On the definition of a family of automata
• On a Theorem of R. Jungen
• Conjugacy and Equivalence of Weighted Automata and Functional Transducers
• Pumping Lemmas for Regular Sets
• Sur divers produits de séries formelles
• Sur un Théorème de Shamir
• The equivalence problem for deterministic finite-turn pushdown automata
• An Introduction to Symbolic Dynamics and Coding
• The equality problem for rational series with multiplicities in the tropical semiring is undecidable
• On Relations Defined by Generalized Finite Automata
• Automata, Languages and Programming
• On Ordered Division Rings
• Ordering by Divisibility in Abstract Algebras
• Implementation and Application of Automata