On the recognition of context-free languages
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 318-325
- https://doi.org/10.1007/3-540-16066-3_26
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The Complexity of Two-Way Pushdown Automata and Recursive ProgramsPublished by Springer Nature ,1985
- The recognition of deterministic CFLs in small time and spaceInformation and Control, 1983
- Parallel time O(log N) acceptance of deterministic CFLsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Parallel Matrix and Graph AlgorithmsSIAM Journal on Computing, 1981
- A recognition algorithm for deterministic CFLs optimal in time and spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Deterministic CFL's are accepted simultaneously in polynomial time and log squared spacePublished by Association for Computing Machinery (ACM) ,1979
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978