Brzozowski’s and Up-To Algorithms for Must Testing

DOI10.1007/978-3-319-03542-0_1zbMath1426.68180OpenAlexW1938581937MaRDI QIDQ2937778

Alexandra Silva, Damien Pous, Filippo Bonchi, Georgiana Caltais

Publication date: 12 January 2015

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1822/38259

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

A coalgebraic view on decorated traces ⋮ Automata Learning: A Categorical Perspective

This page was built for publication: Brzozowski’s and Up-To Algorithms for Must Testing