Coinductive proof techniques for language equivalence

DOI10.1007/978-3-642-37064-9_42MaRDI QIDQ4910486zbMATH OpenOpenAlexFDO

Authors Jurriaan Rot, Marcello M. Bonsangue, Jan J. M. M. Rutten

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_42

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Proving language inclusion and equivalence by coinduction
• Coalgebraic up-to techniques
• Algebra and Coalgebra in Computer Science
• Coinductive algorithms for Büchi automata
• Coinductive algorithms for Büchi automata

Cited in

(11)

• Coinductive algorithms for Büchi automata
• Coalgebraic up-to techniques
• Checking NFA equivalence with bisimulations up to congruence
• Deciding synchronous Kleene algebra with derivatives
• scientific article; zbMATH DE number 5677418 (Why is no real title available?)
• Coinductive algorithms for Büchi automata
• Equations, contractions, and unique solutions
• Enhanced coalgebraic bisimulation
• Algebra and Coalgebra in Computer Science
• Well-behaved (co)algebraic semantics of regular expressions in Dafny
• Proving language inclusion and equivalence by coinduction

Describes a project that uses

Uses Software

• CIRC

This page was built for publication: Coinductive proof techniques for language equivalence

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