Free inductive \(K\)-semialgebras

DOI10.1016/j.jlap.2013.01.001zbMath1286.68332arXiv1009.4820OpenAlexW1748837224MaRDI QIDQ383784

Zoltán Ésik, Werner Kuich

Publication date: 6 December 2013

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

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

zbMATH Keywords

complete axiomatizationfixed point inductioninductive semiringrational power series

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Algebraic structures (08A99) Ordered structures (06F99)

Related Items (5)

A connection between concurrency and language theory ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Equational theories for 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
• Free iterative and iteration \(K\)-semialgebras
• Complete systems of \(\mathcal B\)-rational identities
• Group axioms for iteration
• A completeness theorem for Kleene algebras and the algebra of regular events
• Inductive \(^{*}\)-semirings
• Matrix and matricial iteration theories. I
• Axiomatizing rational power series over natural numbers
• Conjugacy and Equivalence of Weighted Automata and Functional Transducers
• Une remarque sur les systèmes complets d'identités rationnelles
• Iteration Semirings
• A GENERALIZATION OF KOZEN'S AXIOMATIZATION OF THE EQUATIONAL THEORY OF THE REGULAR SETS
• Finite Automata
• Two Complete Axiom Systems for the Algebra of Regular Events
• Automata, Languages and Programming

This page was built for publication: Free inductive \(K\)-semialgebras