Rewriting extended regular expressions
From MaRDI portal
Publication:673635
DOI10.1016/0304-3975(95)80010-7zbMath0873.68104OpenAlexW2002963162MaRDI QIDQ673635
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
Related Items (10)
Rewriting regular inequalities ⋮ Deciding Regular Expressions (In-)Equivalence in Coq ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ Automated temporal verification for algebraic effects ⋮ A synchronous effects logic for temporal verification of pure Esterel ⋮ Determinization of inverted grammar programs via context-free expressions ⋮ Partial derivatives of regular expressions and finite automaton constructions ⋮ Embedding finite automata within regular expressions ⋮ Partial Derivative Automata Formalized in Coq ⋮ On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On equations for regular languages, finite automata, and sequential networks
- Generalized language equations with multiple solutions
- Complexity of matching problems
- Complete systems of \(\mathcal B\)-rational identities
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Intersection and union of regular languages and state complexity
- Une remarque sur les systèmes complets d'identités rationnelles
- Action Semantics
- Two Complete Axiom Systems for the Algebra of Regular Events
- A Procedure for Checking Equality of Regular Expressions
- Two Complete Axiom Systems for the Extended Language of Regular Expressions
- Derivatives of Regular Expressions
This page was built for publication: Rewriting extended regular expressions
