Mutation of Directed Graphs -- Corresponding Regular Expressions and Complexity of Their Generation
Directed graphs (DG), interpreted as state transition diagrams, are traditionally used to represent finite-state automata (FSA). In the context of formal languages, both FSA and regular expressions (RE) are equivalent in that they accept and generate, respectively, type-3 (regular) languages. Based...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Open Publishing Association
2009-07-01
|
| coleção: | Electronic Proceedings in Theoretical Computer Science |
| Acesso em linha: | http://arxiv.org/pdf/0907.5055v1 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|