Results 301 to 310 of about 318,670 (335)
Some of the next articles are maybe not open access.
Acta Informatica, 1994
A text is a triple \(\tau=(\lambda,\rho_ 1,\rho_ 2)\) such that \(\lambda\) is a labeling function, and \(\rho_ 1\) and \(\rho_ 2\) are linear orders on the domain of \(\lambda\); hence \(\tau\) may be seen as a word \((\lambda,\rho_ 1)\) together with an additional linear order \(\rho_ 2\) on the domain of \(\lambda\). The order \(\rho_ 2\) is used to
Ehrenfeucht, A. +2 more
openaire +2 more sources
A text is a triple \(\tau=(\lambda,\rho_ 1,\rho_ 2)\) such that \(\lambda\) is a labeling function, and \(\rho_ 1\) and \(\rho_ 2\) are linear orders on the domain of \(\lambda\); hence \(\tau\) may be seen as a word \((\lambda,\rho_ 1)\) together with an additional linear order \(\rho_ 2\) on the domain of \(\lambda\). The order \(\rho_ 2\) is used to
Ehrenfeucht, A. +2 more
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 +1 more source
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 +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
On translating context-free grammars into Lambek grammars
Proceedings of the Steklov Institute of Mathematics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Introduction to Stochastic Context Free Grammars
2013Stochastic context free grammars are a formalism which plays a prominent role in RNA secondary structure analysis. This chapter provides the theoretical background on stochastic context free grammars. We recall the general definitions and study the basic properties, virtues, and shortcomings of stochastic context free grammars.
openaire +2 more sources
Extraction of organic chemistry grammar from unsupervised learning of chemical reactions
Science Advances, 2021Philippe Schwaller +2 more
exaly
Sequence grammar underlying the unfolding and phase separation of globular proteins
Molecular Cell, 2022Kiersten M Ruff +2 more
exaly