3440 search results - page 3 / 688 » Logics For Context-Free Languages |
ICGI
2010
Springer
14 years 10 months ago
2010
Springer
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
DLT
2001
14 years 11 months ago
2001
Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization all...
ICGI
2010
Springer
14 years 10 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
DLT
2009
14 years 7 months ago
2009
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...
ICTAC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper, I present the class of linear context free languages (LCFLs) with a class of non-deterministic one-way two-head (read only) automata, called non-determinis...