Rewriting extended regular expressions

DOI10.1016/0304-3975(95)80010-7MaRDI QIDQ673635zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Horn-equational axiomatizationterm-rewriting techniques

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

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

Cites work

• scientific article; zbMATH DE number 4018407 (Why is no real title available?)
• scientific article; zbMATH DE number 4180819 (Why is no real title available?)
• scientific article; zbMATH DE number 58315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 549971 (Why is no real title available?)
• scientific article; zbMATH DE number 1142311 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 3307592 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• scientific article; zbMATH DE number 3405859 (Why is no real title available?)
• A Procedure for Checking Equality of Regular Expressions
• Action Semantics
• Complete systems of \(\mathcal B\)-rational identities
• Complexity of matching problems
• Derivatives of Regular Expressions
• Generalized language equations with multiple solutions
• Intersection and union of regular languages and state complexity
• On equations for regular languages, finite automata, and sequential networks
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Two Complete Axiom Systems for the Algebra of Regular Events
• Two Complete Axiom Systems for the Extended Language of Regular Expressions
• Une remarque sur les systèmes complets d'identités rationnelles

Cited in

(15)

• 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
• Embedding finite automata within regular expressions
• Deciding regular expressions (in-)equivalence in Coq
• Automated temporal verification for algebraic effects
• Determinization of inverted grammar programs via context-free expressions
• Rewriting regular inequalities
• Automated verification for real-time systems. Via implicit clocks and an extended Antimirov algorithm
• Partial derivatives of regular expressions and finite automaton constructions
• scientific article; zbMATH DE number 3211094 (Why is no real title available?)
• Rewriting of regular expressions and regular path queries
• scientific article; zbMATH DE number 2043550 (Why is no real title available?)
• scientific article; zbMATH DE number 4018407 (Why is no real title available?)
• Manipulation of regular expressions using derivatives: an overview

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)