ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED
From MaRDI portal
Publication:3395137
DOI10.1142/S0129054109006802zbMath1191.68357MaRDI QIDQ3395137
Nelma Moreira, Marco Almeida, Rogério Reis
Publication date: 21 August 2009
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
derivatives; regular expressions; rewriting systems; regular languages; partial derivatives; minimal automata; regular expression equivalence
Related Items
Automated temporal verification for algebraic effects, Manipulation of regular expressions using derivatives: an overview, Deciding Kleene algebra terms equivalence in Coq, Deciding Regular Expressions (In-)Equivalence in Coq, Partial Derivative Automata Formalized in Coq
Cites Work
- Partial derivatives of regular expressions and finite automaton constructions
- Generating words in a context-free language uniformly at random
- A completeness theorem for Kleene algebras and the algebra of regular events
- Follow automata.
- Enumeration and generation with a string automata representation
- THE ABSTRACT THEORY OF AUTOMATA
- Two Complete Axiom Systems for the Algebra of Regular Events
- Derivatives of Regular Expressions