Realization of Events by Logical Nets
Journal of the ACM (JACM)
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Formally based static analysis of microcode
MICRO 19 Proceedings of the 19th annual workshop on Microprogramming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Regular path queries with constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Procedure for Checking Equality of Regular Expressions
Journal of the ACM (JACM)
A Unified Approach to Path Problems
Journal of the ACM (JACM)
Equational Axioms for Probabilistic Bisimilarity
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Graded Modalities and Resource Bisimulation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
The Equational Theory of Fixed Points with Applications to Generalized Language Theory
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Axiomatizing the Least Fixed Point Operation and Binary Supremum
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Greibach Normal Form in Algebraically Complete Semirings
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the equational definition of the least prefixed point
Theoretical Computer Science - Mathematical foundations of computer science
On the complexity of reasoning in Kleene algebra
Information and Computation - Special issue: LICS'97
An algebraic system for process structuring and interprocess communication
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Dynamic algebras and the nature of induction
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Recursion induction applied to generalized flowcharts
ACM '69 Proceedings of the 1969 24th national conference
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An extension theorem with an application to formal tree series
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Mathematical Structures in Computer Science
A coalgebraic approach to Kleene algebra with tests
Theoretical Computer Science - Selected papers of CMCS'03
A regular viewpoint on processes and algebra
Acta Cybernetica
A duality between proof systems for cyclic term graphs
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
On Logic with Fuzzy and Rough Powerset Monads
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Antimirov and Mosses's Rewrite System Revisited
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Axiomatizing rational power series over natural numbers
Information and Computation
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Composing Partially Ordered Monads
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
On Equivalences for a Class of Timed Regular Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
Regular expressions and the equivalence of programs
Journal of Computer and System Sciences
Optimal lower bounds on regular expression size using communication complexity
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Is observational congruence on μ-expressions axiomatisable in equational Horn logic?
Information and Computation
The reaction algebra: a formal language for event correlation
Pillars of computer science
Partially ordered monads and rough sets
Transactions on rough sets VIII
Algorithms and theory of computation handbook
Regular expression containment: coinductive axiomatization and computational interpretation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Quantitative Kleene coalgebras
Information and Computation
A decision procedure for bisimilarity of generalized regular expressions
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Omega algebras and regular equations
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Multi-Linear Iterative K-Σ-Semialgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Using proofs by coinduction to find “traditional” proofs
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
The inclusion problem for regular expressions
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
An approach to software system behavior description
Computer Languages
Automated analysis of regular algebra
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
The inclusion problem for regular expressions
Journal of Computer and System Sciences
Coinductive Axiomatization of Recursive Type Equality and Subtyping
Fundamenta Informaticae
A COMPLETE AXIOMATIZATION FOR PREFIX ITERATION IN BRANCHING BISIMULATION
Fundamenta Informaticae
Automated reasoning in higher-order regular algebra
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
On completeness of omega-regular algebras
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
| Hi-index | 0.01 |
The theory of finite automata is closely linked with the theory of Kleene's regular expressions. In this paper, two formal systems for the algebraic transformation of regular expressions are developed. Both systems are consistent and complete; i.e., the set of equations derivable within the system equals the set of equations between two regular expressions denoting the same event. One of the systems is based upon the uniqueness of the solution of certain regular expression equations, whereas some facts concerning the representation theory of regular events are used in connection with the other.