Coinductive proof techniques for language equivalence

DOI10.1007/978-3-642-37064-9_42zbMATH Open1333.68173OpenAlexW2103294040MaRDI QIDQ4910486FDOQ4910486

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (10)

• Deciding synchronous Kleene algebra with derivatives
• Title not available (Why is that?)
• Equations, contractions, and unique solutions
• Coalgebraic up-to techniques
• Proving language inclusion and equivalence by coinduction
• Checking NFA equivalence with bisimulations up to congruence
• Algebra and Coalgebra in Computer Science
• Coinductive algorithms for Büchi automata
• Coinductive algorithms for Büchi automata
• Enhanced coalgebraic bisimulation

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)