Equational axioms for regular sets
From MaRDI portal
Publication:4279247
DOI10.1017/S0960129500000104zbMath0796.68153WikidataQ114653954 ScholiaQ114653954MaRDI QIDQ4279247
Publication date: 22 September 1994
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
iteration theories; Lawvere theories; axiomatizations; equational axioms; matrix theories; equational axiomatization; Kleene star operation; semiring of regular sets; fixed point operation
08A70: Applications of universal algebra in computer science
68Q70: Algebraic theory of languages and automata
03C05: Equational classes, universal algebra in model theory
Related Items
Domain mu-calculus, Parametric corecursion, The algebra of stream processing functions, Fixed-point operations on ccc's. I, Equational properties of Kleene algebras of relations with conversion, Axiomatizing the identities of binoid languages, Completions of \(\mu \)-algebras, Equational properties of iteration in algebraically complete categories, On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based, Group axioms for iteration, On dynamic algebras, Notes on equational theories of relations, An equational axiomatization for multi-exit iteration, Nonaxiomatisability of equivalences over finite state processes, Axiomatizing shuffle and concatenation in languages, The equational logic of fixed points, Completeness of Park induction, 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., Automata, Boolean matrices, and ultimate periodicity., On equations for union-free regular languages, Inductive \(^{*}\)-semirings, The variety of Kleene algebras with conversion is not finitely based, Matrix and matricial iteration theories. I, Matrix and matricial iteration theories. II, On the complexity of reasoning in Kleene algebra, Matrices, machines and behaviors, Iteration Semirings
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
