Results 321 to 330 of about 459,830 (368)
Some of the next articles are maybe not open access.
Context-Free Grammars and XML Languages
2006We study the decision properties of XML languages. It was known that given a context-free language included in the Dyck language with sufficiently many pairs of parentheses, it is undecidable whether or not it is an XML language. We improve on this result by showing that the problem remains undecidable when the language is written on a unique pair of ...
A. Bertoni, C. Choffrut, B. Palano
openaire +4 more sources
On a Construction of Context-free Grammars
Fundamenta Informaticae, 2000The grammatical inference problem is solved for the class of context-free languages. A context-free language is supposed to be given by means of all its strings. Considering all strings of length bounded by k, context-free grammars G_{j,k} with 1≤j<k are constructed. A~continual increasing of the index~$k$ leads to an~infinite sequence (G_{j,k})_{j&
openaire +2 more sources
1993
Context-free grammars are a language for defining languages. Not all languages can be defined by a context-free grammar — only the (yes) context-free ones. Suppose we want to define the language of a small child, who continually says sentences like “want cookie”. His or her sentences consist of a verb followed by a noun.
openaire +2 more sources
Context-free grammars are a language for defining languages. Not all languages can be defined by a context-free grammar — only the (yes) context-free ones. Suppose we want to define the language of a small child, who continually says sentences like “want cookie”. His or her sentences consist of a verb followed by a noun.
openaire +2 more sources
Context-Free Grammars and Languages
1977You may have seen something like the following used to give a formal defini-tion of a language. This notation is sometimes called BNF for Backus-Naur form.
openaire +2 more sources
A novel context-free grammar for the generation of PSO algorithms
Natural Computing, 2018P. Miranda, R. Prudêncio
semanticscholar +1 more source
A context-free grammar for Caenorhabditis elegans behavior
bioRxiv, 2019Saurabh Gupta, A. Gomez-Marin
semanticscholar +1 more source
A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS
International Journal of Foundations of Computer Science, 2008We define a complexity measure on context-free grammars called end. Roughly speaking, for a context-free grammar G, endG(n) measures the distance of variables from the ends of sentential forms along the derivations of words in L(G) of length n. We prove in a constructive way the regularity of L(G)wheneverendG(n)is constant.
openaire +3 more sources
Synthesis of social media profiles using a probabilistic context-free grammar
2017 Pattern Recognition Association of South Africa and Robotics and Mechatronics (PRASA-RobMech), 2017Abejide Ade-ibijola
semanticscholar +1 more source
A New Grammatical Evolution Based on Probabilistic Context-free Grammar
, 2015Hyun-Tae Kim, C. Ahn
semanticscholar +1 more source
Birdsong neurolinguistics: songbird context-free grammar claim is premature
NeuroReport, 2012Gabriel J. L. Beckers +3 more
semanticscholar +1 more source