182 search results - page 15 / 37 » Context-Free Valence Grammars - Revisited |
ICGI
2010
Springer
13 years 8 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...
NAACL
2010
13 years 5 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
GG
2010
Springer
13 years 8 months ago
2010
Springer
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...