Testing equivalence of regular languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcr...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2010
|
| Assuntos: | |
| Texto completo: | https://repositorio-aberto.up.pt/handle/10216/94982 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/94982 |