3 search results - page 1 / 1 » Identifying Left-Right Deterministic Linear Languages |
ICGI
2004
Springer
13 years 10 months ago
2004
Springer
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...
PAMI
1998
13 years 4 months ago
1998
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...
PLDI
2010
ACM
14 years 2 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...