Finite-State Techniques
-10%
portes grátis
Finite-State Techniques
Automata, Transducers and Bimachines
Mihov, Stoyan; Schulz, Klaus U.
Cambridge University Press
08/2019
314
Dura
Inglês
9781108485418
15 a 20 dias
570
Descrição não disponível.
Part I. Formal Background: 1. Formal preliminaries; 2. Monoidal finite-state automata; 3. Classical finite-state automata and regular languages; 4. Monoidal multi-tape automata and finite-state transducers; 5. Deterministic transducers; 6. Bimachines; Part II. From Theory to Practice: 7. The C(M) language; 8. C(M) implementation of finite-state devices; 9. The Aho-Corasick algorithm; 10. The minimal deterministic finite-state automaton for a finite language; 11. Constructing finite-state devices for text rewriting; Bibliography; Index.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Part I. Formal Background: 1. Formal preliminaries; 2. Monoidal finite-state automata; 3. Classical finite-state automata and regular languages; 4. Monoidal multi-tape automata and finite-state transducers; 5. Deterministic transducers; 6. Bimachines; Part II. From Theory to Practice: 7. The C(M) language; 8. C(M) implementation of finite-state devices; 9. The Aho-Corasick algorithm; 10. The minimal deterministic finite-state automaton for a finite language; 11. Constructing finite-state devices for text rewriting; Bibliography; Index.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
