Brzozowski's and up-to algorithms for must testing
Checking language equivalence (or inclusion) of finite automata is a classical problem in Computer Science, which has recently received a renewed interest and found novel and more effective solutions, such as approaches based on antichains or bisimulations up-to. Several notions of equivalence (or p...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/38259 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/38259 |