Antimirov and Mosses’s Rewrite System Revisited

DOI10.1007/978-3-540-70844-5_6zbMath1172.68481OpenAlexW1906382166MaRDI QIDQ3602800

Marco Almeida, Rogério Reis, Nelma Moreira

Publication date: 12 February 2009

Published in: Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_6

zbMATH Keywords

derivativesregular expressionsrewriting systemsregular languagespartial derivativesminimal automataregular expression equivalence

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• 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