Parallel parsing on a one-way linear array of finite-state machines

Authors:
Oscar H. Ibarra
Affiliations:
Univ. of California, Santa Barbara
Venue:
Theoretical Computer Science
Year:
1991

Citing 0
Cited 2

Finite turns and the regular closure of linear context-free languages

Discrete Applied Mathematics
The boolean closure of linear context-free languages

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract