Some descriptional complexity problems in finite automata theory.
Automata Theory is one of the oldest and well studied areas in theoretical computer science. Almost all not very hard problems, yet of main interest have been solved. The excit-ing developments in theoretical computer science for more than two decades ago produced very specialized computer scientist...
| Izdano u: | Philippine computing journal 3, 1(O) (2008). |
|---|---|
| Glavni autor: | |
| Format: | Članak |
| Jezik: | English |
| Teme: | |
| Online pristup: | Available also online . Click here to access |