7 search results - page 1 / 2 » A Formalisation of the Normal Forms of Context-Free Grammars... |
CSL
2010
Springer
13 years 6 months ago
2010
Springer
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...
WOLLIC
2010
Springer
13 years 3 months ago
2010
Springer
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...
JALC
2006
13 years 5 months ago
2006
-- Let {a1, a2, . . . , an} be an alphabet of n symbols and let Cn be the language of circular shifts of the word a1a2
DLT
2001
13 years 6 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...
NAACL
2010
13 years 2 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...