ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED

DOI10.1142/S0129054109006802zbMATH Open1191.68357MaRDI QIDQ3395137FDOQ3395137

Authors: Marco Almeida, Nelma Moreira, Rogério Reis 

Publication date: 21 August 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• Antimirov and Mosses’s Rewrite System Revisited
• Testing the equivalence of regular languages
• Deciding regular expressions (in-)equivalence in Coq
• Regular-expression derivatives re-examined
• A Decision Procedure for Regular Expression Equivalence in Type Theory

zbMATH Keywords

partial derivativesminimal automataregular languagesderivativesregular expressionsrewriting systemsregular expression equivalence

Mathematics Subject Classification ID

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

Cites Work

• THE ABSTRACT THEORY OF AUTOMATA
• Derivatives of Regular Expressions
• Partial derivatives of regular expressions and finite automaton constructions
• Two Complete Axiom Systems for the Algebra of Regular Events
• A completeness theorem for Kleene algebras and the algebra of regular events
• Follow automata.
• Enumeration and generation with a string automata representation
• Generating words in a context-free language uniformly at random

Cited In (7)

• Partial derivative automata formalized in Coq
• Testing the equivalence of regular languages
• 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
• Antimirov and Mosses’s Rewrite System Revisited

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

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