Sciweavers

ICGI
2004
Springer
14 years 4 months ago
Identifying Left-Right Deterministic Linear Languages
Abstract. Left deteministic linear languages are a subclass of the context free languages that includes all the regular languages. Recently was proposed an algorithm to identify in...
Jorge Calera-Rubio, José Oncina