The complexity of the max word problem
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 456-465
- https://doi.org/10.1007/bfb0020820
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The ring of k-regular sequencesPublished by Springer Nature ,1990
- On the complexity of space bounded interactive proofsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Space bounded probabilistic game automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- Automata-Theoretic Aspects of Formal Power SeriesPublished by Springer Nature ,1978
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Word Problems Solvable in LogspaceJournal of the ACM, 1977
- Probabilistic automataInformation and Control, 1963