Equational theories for automata
From MaRDI portal
Publication:2074221
DOI10.4171/Automata-1/20OpenAlexW4205618076MaRDI QIDQ2074221
Publication date: 4 February 2022
Full work available at URL: https://doi.org/10.4171/automata-1/20
Cites Work
- Free inductive \(K\)-semialgebras
- Free iterative and iteration \(K\)-semialgebras
- Continuous monoids and semirings
- A Kleene-Schützenberger theorem for weighted timed automata
- Equational properties of Kleene algebras of relations with conversion
- A note on equations for commutative regular languages
- Axiomatizing the equational theory of regular tree languages
- Monoides et semi-anneaux complets. (Complete monoids and semirings)
- Monoides et semi-anneaux continus. (Continuous monoids and semirings)
- A complete axiom system for rational sets with multiplicity
- A calculus of communicating systems
- Algebraic semantics
- Complete systems of \(\mathcal B\)-rational identities
- Dynamic algebras: Examples, constructions, applications
- Chain-complete posets and directed sets with applications
- Varieties of ordered algebras
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
- Group axioms for iteration
- A completeness theorem for Kleene algebras and the algebra of regular events
- Notes on equational theories of relations
- On the completeness of propositional Hoare logic
- From semirings to residuated Kleene lattices
- Simple program schemes and formal languages
- On equations for union-free regular languages
- Inductive \(^{*}\)-semirings
- Representations of distributive lattice-ordered semigroups with binary relations
- Matrix and matricial iteration theories. I
- Axiomatizing rational power series over natural numbers
- On iteration semiring-semimodule pairs.
- On the complexity of reasoning in Kleene algebra
- Equational Axioms for Probabilistic Bisimilarity
- Newtonian program analysis
- Automata Studies. (AM-34)
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- On Action Logic: Equational Theories of Action Algebras
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Une remarque sur les systèmes complets d'identités rationnelles
- The complexity of equivalence problems for commutative grammars
- Matrix versions of aperiodic $K$-rational identities
- Soundness and Completeness of an Axiom System for Program Verification
- Equational axioms for regular sets
- Floyd-Hoare logic in iteration theories
- Une condition impliquant toutes les identités rationnelles
- A Fully Equational Proof of Parikh's Theorem
- A GENERALIZATION OF KOZEN'S AXIOMATIZATION OF THE EQUATIONAL THEORY OF THE REGULAR SETS
- Semirings and Formal Power Series
- Finite Automata
- Kleene algebra with domain
- On the Complexity of the Equational Theory of Relational Action Algebras
- Two Complete Axiom Systems for the Algebra of Regular Events
- Automata, Languages and Programming
- 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
- 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
- Unnamed Item
- Unnamed Item
