Antimirov and Mosses’s Rewrite System Revisited

DOI10.1007/978-3-540-70844-5_6MaRDI QIDQ3602800zbMATH OpenOpenAlexFDO

Authors Marco Almeida, Nelma Moreira, Rogério Reis

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

partial derivativesminimal automataregular languagesderivativesregular expressionsrewriting systemsregular expression equivalence

Mathematics Subject Classification ID

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

Recommendations

• ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED
• scientific article; zbMATH DE number 4088915
• Existence, Uniqueness, and Construction of Rewrite Systems
• An abstract formulation for rewrite systems
• scientific article; zbMATH DE number 2043547
• scientific article; zbMATH DE number 1419256
• scientific article; zbMATH DE number 177826
• Higher-order rewrite systems and their confluence
• scientific article; zbMATH DE number 7456055

Cites work

• scientific article; zbMATH DE number 3932372 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 1033559 (Why is no real title available?)
• A completeness theorem for Kleene algebras and the algebra of regular events
• Derivatives of Regular Expressions
• Follow automata.
• Generating words in a context-free language uniformly at random
• Partial derivatives of regular expressions and finite automaton constructions
• Regular expressions: new results and open problems
• Two Complete Axiom Systems for the Algebra of Regular Events

Cited in

(2)

• Testing the equivalence of regular languages
• 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 Q3602800)