3440 search results - page 20 / 688 » Logics For Context-Free Languages |
LICS
2006
IEEE
15 years 8 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
116
click to vote
LOGCOM
2008
15 years 1 months ago
2008
This paper defines the grammar class of sequentially indexed grammars (SIGs) that results of a change in the index stack handling mechanism of indexed grammars [Aho68, Aho69]. SIG...
113
click to vote
ICGI
2004
Springer
15 years 7 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...
109
click to vote
LATA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
116
click to vote
ACL
1993
15 years 3 months ago
1993
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...