Rewriting extended regular expressions

DOI10.1016/0304-3975(95)80010-7zbMATH Open0873.68104OpenAlexW2002963162MaRDI QIDQ673635FDOQ673635

Authors: Valentin Antimirov, Peter D. Mosses 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)80010-7

Recommendations

• A completeness theorem for Kleene algebras and the algebra of regular events
• Symbolic solving of extended regular expression inequalities
• scientific article; zbMATH DE number 1136085
• scientific article; zbMATH DE number 3883630
• Axiomatizing the equational theory of regular tree languages

zbMATH Keywords

Horn-equational axiomatizationterm-rewriting techniques

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Derivatives of Regular Expressions
• Title not available (Why is that?)
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Two Complete Axiom Systems for the Algebra of Regular Events
• Complete systems of \(\mathcal B\)-rational identities
• Une remarque sur les systèmes complets d'identités rationnelles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized language equations with multiple solutions
• On equations for regular languages, finite automata, and sequential networks
• Complexity of matching problems
• Intersection and union of regular languages and state complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Action Semantics
• A Procedure for Checking Equality of Regular Expressions
• Two Complete Axiom Systems for the Extended Language of Regular Expressions
• Title not available (Why is that?)

Cited In (15)

• Rewriting of regular expressions and regular path queries
• Rewriting regular inequalities
• Title not available (Why is that?)
• Partial derivatives of regular expressions and finite automaton constructions
• Partial derivative automata formalized in Coq
• A synchronous effects logic for temporal verification of pure Esterel
• On the state complexity of partial derivative automata for regular expressions with intersection
• Automated temporal verification for algebraic effects
• Manipulation of regular expressions using derivatives: an overview
• Title not available (Why is that?)
• Deciding regular expressions (in-)equivalence in Coq
• Embedding finite automata within regular expressions
• Title not available (Why is that?)
• Automated verification for real-time systems. Via implicit clocks and an extended Antimirov algorithm
• Determinization of inverted grammar programs via context-free expressions

This page was built for publication: Rewriting extended regular expressions

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