Coalgebraic up-to techniques

DOI10.1007/978-3-642-40206-7_4zbMATH Open1394.68215OpenAlexW83031784MaRDI QIDQ2848937FDOQ2848937

Authors: Damien Pous 

Publication date: 13 September 2013

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40206-7_4

Recommendations

• Proving language inclusion and equivalence by coinduction
• Checking NFA equivalence with bisimulations up to congruence
• Coinductive proof techniques for language equivalence
• Brzozowski's and up-to algorithms for must testing
• Coinductive algorithms for Büchi automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Categories of machines, automata (18B20)

Cited In (7)

• Brzozowski's and up-to algorithms for must testing
• Proving language inclusion and equivalence by coinduction
• Title not available (Why is that?)
• Checking NFA equivalence with bisimulations up to congruence
• Coinductive proof techniques for language equivalence
• Coinductive algorithms for Büchi automata
• Coinductive algorithms for Büchi automata

This page was built for publication: Coalgebraic up-to techniques

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