The Computational Complexity of Tomita’s Algorithm

Mark Johnson


Anthology ID:
W89-0221
Volume:
Proceedings of the First International Workshop on Parsing Technologies
Month:
August
Year:
1989
Address:
Pittsburgh, Pennsylvania, USA
Venues:
IWPT | WS
SIG:
SIGPARSE
Publisher:
Carnegy Mellon University
Note:
Pages:
203–208
Language:
URL:
https://aclanthology.org/W89-0221
DOI:
Bibkey:
Cite (ACL):
Mark Johnson. 1989. The Computational Complexity of Tomita’s Algorithm. In Proceedings of the First International Workshop on Parsing Technologies, pages 203–208, Pittsburgh, Pennsylvania, USA. Carnegy Mellon University.
Cite (Informal):
The Computational Complexity of Tomita’s Algorithm (Johnson, 1989)
Copy Citation:
PDF:
https://preview.aclanthology.org/update-css-js/W89-0221.pdf