Probabilistic and nondeterministic unary automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 460-469

  Gramlich, Gregor ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FINITE AUTOMATA;

CUT-POINT; CYCLIC LANGUAGES; DETERMINISTIC FINITE AUTOMATA; ERROR BOUND; NONDETERMINISTIC FINITE AUTOMATON; PROBABILISTIC AUTOMATA; PROBABILISTIC FINITE AUTOMATA;

PIPELINE PROCESSING SYSTEMS;

EID: 33645626080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_40     Document Type: Article

References (10)

1. Chrobak, M.: Finite automata and unary languages, Theoretical Computer Science 47, 1986, pp. 149-158.
2. Gantmacher, F.R.: Theory of Matrices, Vol. II, Chelsea, New York, 1959.
3. Graham, R., Knuth, D., Patashnik, O.: Concrete Mathematics, Addison Wesley, Reading, Massachusetts, 1989.
4. Jiang, T., McDowell, E., Ravikumar, B.: The structure and complexity of minimal NFA's over a unary alphabet, Int. J. Found. of Comp. Sci., 2, 1991, pp. 163-182.
5. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard, SIAM Journal on Computing, 22 (1), 1993, pp. 1117-1141.
6. Hochbaum, D. (editor): Approximation algorithms for NP-hard problems, PWS Publishing Company, Boston, 1997.
7. Mereghetti, C., Palano, B., Pighizzini, G.: On the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata, DCAGRS 2001.
8. Milani, M., Pighizzini, G.: Tight bounds on the simulation of unary probabilistic automata by deterministic automata, DCAGRS 2000.
9. Rabin, M.: Probabilistic automata, Information and Control, 1963, pp. 230-245.
10. Stockmeyer, L., Meyer, A.: Word Problems Requiring Exponential Time, Proc. of the 5th Ann. ACM Symposium on Theory of Computing, New York, 1973, pp. 1-9.