Testing the equivalence of regular languages

DOI10.25596/JALC-2010-007MaRDI QIDQ2819377zbMATH OpenFDO

Authors Marco Almeida, Nelma Moreira, Rogério Reis

Publication date 29 September 2016

Published in Journal of Automata, Languages and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.25596/JALC-2010-007

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(8)

• Manipulation of regular expressions using derivatives: an overview
• Deciding Kleene algebra terms equivalence in Coq
• On the semantics of regular expression parsing in the wild
• Deciding regular expressions (in-)equivalence in Coq
• Deciding synchronous Kleene algebra with derivatives
• Partial derivative automata formalized in Coq
• New
• Language quotients revisited

This page was built for publication: Testing the equivalence of regular languages

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