21 search results - page 1 / 5 » Strongly Regular Grammars and Regular Approximation of Conte... |
DLT
2009
14 years 7 months ago
2009
Abstract. We consider algorithms for approximating context
APLAS
2006
ACM
15 years 3 months ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
WIA
2007
Springer
15 years 3 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
100
click to vote
ACL
1992
14 years 10 months ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
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...