Finite Automata Implementations Considering CPU Cache
The finite automata are mathematical models for finite state systems. More general finite automaton is the nondeterministic finite automaton (NFA) that cannot be directly used. It is usually transformed to the deterministic finite automaton (DFA) that then runs in time O(n), where n is the size of t...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
CTU Central Library
2007-01-01
|
| Series: | Acta Polytechnica |
| Subjects: | |
| Online Access: | https://ojs.cvut.cz/ojs/index.php/ap/article/view/1008 |