ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED

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)

zbMATH Keywords

derivativesregular expressionsrewriting systemsregular languagespartial derivativesminimal automataregular expression equivalence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (5)

Deciding Regular Expressions (In-)Equivalence in Coq ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ Automated temporal verification for algebraic effects ⋮ Partial Derivative Automata Formalized in Coq ⋮ Deciding Kleene algebra terms equivalence 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

This page was built for publication: ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED