Two Complete Axiom Systems for the Algebra of Regular Events

Cited in

(only showing first 100 items - show all)

A complete inference system for a class of regular behaviours
On flowchart theories. II: The nondeterministic case
The equational theory of pomsets
A complete axiom system for rational sets with multiplicity
Complete systems of \(\mathcal B\)-rational identities
Dynamic algebras: Examples, constructions, applications
On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
Regular path queries with constraints
On dynamic algebras
A matrix-linguistic method of analyzing finite discrete dynamic systems
An equational axiomatization for multi-exit iteration
Nonaxiomatisability of equivalences over finite state processes
The equational logic of fixed points
A calculational approach to mathematical induction
Notes on the methodology of CCS and CSP
On the equational definition of the least prefixed point.
Regular expression simplification
Language preorder as a precongruence
Finite-trace linear temporal logic: coinductive completeness
The inclusion problem for regular expressions
Algebraically complete semirings and Greibach normal form
Invariants and closures in the theory of rewrite systems
Automata, Boolean matrices, and ultimate periodicity.
On equations for union-free regular languages
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Left omega algebras and regular equations
Models of nondeterministic regular expressions
The variety of Kleene algebras with conversion is not finitely based
Equational theories for automata
Complete axiomatization for the total variation distance of Markov chains
Axiomatizing recursion-free, regular monitors
Manipulation of regular expressions using derivatives: an overview
Left-handed completeness
Completeness results for omega-regular algebras
On the fine-structure of regular algebra
Matrix and matricial iteration theories. II
Factor theory and the unity of opposites
Axiomatizing rational power series over natural numbers
Inductive semimodules and the vector modules over them.
On the complexity of reasoning in Kleene algebra
Regular expressions and the equivalence of programs
Fuzzy terms
Unique, guarded fixed points in an additive setting: extended abstract
Conway and iteration hemirings. I.
Automated Reasoning in Higher-Order Regular Algebra
Left-handed completeness
On completeness of omega-regular algebras
Algorithms for Kleene algebra with converse
Developments in concurrent Kleene algebra
A Decision Procedure for Bisimilarity of Generalized Regular Expressions
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
Deriving Syntax and Axioms for Quantitative Regular Behaviours
On the positive calculus of relations with transitive closure
ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED
Une remarque sur les systèmes complets d'identités rationnelles
Iteration Semirings
Partially Ordered Monads and Rough Sets
Antimirov and Mosses’s Rewrite System Revisited
Categorical Innovations for Rough Sets
A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
Free inductive K-semialgebras
Matrix versions of aperiodic K-rational identities
Free iterative and iteration K-semialgebras
Translating regular expression matching into transducers
Equational axioms for regular sets
scientific article; zbMATH DE number 6987095 (Why is no real title available?)
Axiomatizations for the perpetual loop in process algebra
Nonfinite axiomatizability of the equational theory of shuffle
A Finite Axiomatization of Nondeterministic Regular Expressions
Partially ordered monads for monadic topologies, rough sets and Kleene algebras
Modeling terms by graphs with structure constraints (two illustrations)
A completeness theorem for nondeterministic Kleene algebras
Reversible Kleene lattices
Quantitative Kleene coalgebras
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
On regular expressions and regular canonical systems
scientific article; zbMATH DE number 3293675 (Why is no real title available?)
Multi-linear iterative \(K\)-\(\Sigma\)-semialgebras.
A complete axiomatisation for trace congruence of finite state behaviors
Infinite results
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
Completeness and the finite model property for Kleene algebra, reconsidered
A complete inference system for skip-free guarded Kleene algebra with tests
Milner's proof system for regular expressions modulo bisimilarity is complete. Crystallization: near-collapsing process graph interpretations of regular expressions
On star expressions and completeness theorems
Rewriting extended regular expressions
Equational properties of Kleene algebras of relations with conversion
An elementary proof of the FMP for Kleene algebra
Cyclic system for an algebraic theory of alternating parity automata
A complete quantitative axiomatisation of behavioural distance of regular expressions
On propositional program equivalence (extended abstract)
Image reflection on process graphs of 1-free regular expressions modulo bisimilarity
A general completeness theorem for skip-free star algebras
On the expressiveness of single-pass instruction sequences
Paraconsistent relations as a variant of Kleene algebras
From compactifying lambda-letrec terms to recognizing regular-expression processes (extended abstract and literature)
A completeness theorem for probabilistic regular expressions
An algebraic theory of nondeterministic finite automata
A cyclic proof system for guarded Kleene algebra with tests

This page was built for publication: Two Complete Axiom Systems for the Algebra of Regular Events

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5528648)