Antimirov and Mosses’s Rewrite System Revisited

DOI10.1007/978-3-540-70844-5_6zbMATH Open1172.68481OpenAlexW1906382166MaRDI QIDQ3602800FDOQ3602800

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

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

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

• Title not available (Why is that?)
• Derivatives of Regular Expressions
• Partial derivatives of regular expressions and finite automaton constructions
• Title not available (Why is that?)
• Two Complete Axiom Systems for the Algebra of Regular Events
• A completeness theorem for Kleene algebras and the algebra of regular events
• Title not available (Why is that?)
• Regular expressions: new results and open problems
• Follow automata.
• Generating words in a context-free language uniformly at random

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)