Two Complete Axiom Systems for the Algebra of Regular Events
From MaRDI portal
Publication:5528648
DOI10.1145/321312.321326zbMath0149.24902OpenAlexW2149366752WikidataQ56140176 ScholiaQ56140176MaRDI QIDQ5528648
Publication date: 1966
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321312.321326
Related Items
Simplifying regular expressions further, Fuzzy terms, A complete axiomatisation for trace congruence of finite state behaviors, Matrix and matricial iteration theories. II, Complete axiomatization for the total variation distance of Markov chains, Behavioural differential equations: a coinductive calculus of streams, automata, and power series, On regular expressions and regular canonical systems, On dynamic algebras, Algorithms for Kleene algebra with converse, Developments in concurrent Kleene algebra, Factor theory and the unity of opposites, Nonfinite axiomatizability of the equational theory of shuffle, Axiomatizing recursion-free, regular monitors, Unnamed Item, Axiomatizing the equational theory of regular tree languages, On flowchart theories. II: The nondeterministic case, Equational axioms for regular sets, Deriving Syntax and Axioms for Quantitative Regular Behaviours, Matrix versions of aperiodic $K$-rational identities, Automated Reasoning in Higher-Order Regular Algebra, Left-Handed Completeness, On Completeness of Omega-Regular Algebras, A matrix-linguistic method of analyzing finite discrete dynamic systems, Axiomatizing rational power series over natural numbers, Inductive semimodules and the vector modules over them., An equational axiomatization for multi-exit iteration, Manipulation of regular expressions using derivatives: an overview, The equational theory of pomsets, Finite-trace linear temporal logic: coinductive completeness, Une remarque sur les systèmes complets d'identités rationnelles, Axiomatizations for the perpetual loop in process algebra, Nonaxiomatisability of equivalences over finite state processes, Free inductive \(K\)-semialgebras, A completeness theorem for nondeterministic Kleene algebras, The equational logic of fixed points, A calculational approach to mathematical induction, Notes on the methodology of CCS and CSP, Left omega algebras and regular equations, Infinite results, Free iterative and iteration \(K\)-semialgebras, A complete axiom system for rational sets with multiplicity, On the equational definition of the least prefixed point., A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity, Regular expression simplification, Translating regular expression matching into transducers, Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks, Completeness and the finite model property for Kleene algebra, reconsidered, Unnamed Item, CCS expressions, finite state processes, and three problems of equivalence, Iteration Semirings, Models of nondeterministic regular expressions, Complete systems of \(\mathcal B\)-rational identities, Unnamed Item, A Decision Procedure for Bisimilarity of Generalized Regular Expressions, The variety of Kleene algebras with conversion is not finitely based, Rewriting extended regular expressions, Equational properties of Kleene algebras of relations with conversion, Dynamic algebras: Examples, constructions, applications, The inclusion problem for regular expressions, On the expressiveness of single-pass instruction sequences, Quantitative Kleene coalgebras, Multi-Linear Iterative K-Σ-Semialgebras, A coalgebraic approach to Kleene algebra with tests, Algebraically complete semirings and Greibach normal form, Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?, Synchronous Kleene algebra, Unnamed Item, Partially Ordered Monads and Rough Sets, A Finite Axiomatization of Nondeterministic Regular Expressions, Antimirov and Mosses’s Rewrite System Revisited, On the complexity of reasoning in Kleene algebra, Left-handed completeness, Optimal Lower Bounds on Regular Expression Size Using Communication Complexity, Categorical Innovations for Rough Sets, Regular expressions and the equivalence of programs, Invariants and closures in the theory of rewrite systems, ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED, On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based, A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time, Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras, Equational theories for automata, Language preorder as a precongruence, Unique, guarded fixed points in an additive setting, Reversible Kleene lattices, A complete inference system for a class of regular behaviours, The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics, Regular path queries with constraints, Automata, Boolean matrices, and ultimate periodicity., On equations for union-free regular languages, Completeness results for omega-regular algebras, On the fine-structure of regular algebra, Conway and iteration hemirings Part 1
