Equational axioms for regular sets
From MaRDI portal
Publication:4279247
DOI10.1017/S0960129500000104zbMath0796.68153OpenAlexW2008967744WikidataQ114653954 ScholiaQ114653954MaRDI QIDQ4279247
Publication date: 22 September 1994
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129500000104
iteration theoriesLawvere theoriesaxiomatizationsequational axiomsmatrix theoriesequational axiomatizationKleene star operationsemiring of regular setsfixed point operation
Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70) Equational classes, universal algebra in model theory (03C05)
Related Items
A connection between concurrency and language theory, A Finite Axiomatisation of Finite-State Automata Using String Diagrams, Matrix and matricial iteration theories. I, Matrix and matricial iteration theories. II, Inductive \(^{*}\)-semirings, On dynamic algebras, Notes on equational theories of relations, Nonfinite axiomatizability of the equational theory of shuffle, Axiomatizing the equational theory of regular tree languages, Axiomatizing rational power series over natural numbers, An equational axiomatization for multi-exit iteration, Axiomatizing the identities of binoid languages, Nonaxiomatisability of equivalences over finite state processes, Axiomatizing shuffle and concatenation in languages, Equational properties of iteration in algebraically complete categories, The equational logic of fixed points, Completeness of Park induction, Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure, Equational properties of iterative monads, Recursion and corecursion have the same equational logic, Infinite trees and completely iterative theories: A coalgebraic view, The multiplicative fragment of the Yanov equational theory, On the equational definition of the least prefixed point., Bisimulations for fuzzy automata, Iteration Semirings, Completions of \(\mu \)-algebras, A string diagrammatic axiomatisation of finite-state automata, The variety of Kleene algebras with conversion is not finitely based, Fixed-point operations on ccc's. I, Equational properties of Kleene algebras of relations with conversion, On the geometry and algebra of networks with state, Fixing Zeno gaps, Parametric corecursion, The algebra of stream processing functions, On the complexity of reasoning in Kleene algebra, The calculus of signal flow diagrams. I: Linear relations on streams., Domain mu-calculus, On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based, Group axioms for iteration, Equational theories for automata, Matrices, machines and behaviors, The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics, Automata, Boolean matrices, and ultimate periodicity., On equations for union-free regular languages, On the fine-structure of regular algebra
Cites Work
- Unnamed Item
- Unnamed Item
- A completeness theorem for Kleene algebras and the algebra of regular events
- Axiomatizing schemes and their behaviors
- Equational logic of circular data type specification
- Varieties of Iteration Theories
- Floyd-Hoare logic in iteration theories
- Two Complete Axiom Systems for the Algebra of Regular Events
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
