Results 251 to 260 of about 8,860,193 (293)

Intrinsic Disorder as a Biomimetic Design Paradigm. [PDF]

Biomimetics (Basel)
Puccinelli T, Bordin JR.
europepmc   +1 more source

Intratracheal Leiomyosarcoma in a 13-Year-Old German Riding Pony Mare. [PDF]

Vet Sci
Hiekel J, Kühnle C, Blaszczyk KZ.
europepmc   +1 more source

The Polytope of Context-Free Grammar Constraints

, 2009
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention in the last few years as it represents an effective and highly expressive modeling entity.
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Rousseau, Meinolf Sellmann   +3 more
openaire   +2 more sources

Determinization of inverted grammar programs via context-free expressions [PDF]

Journal of Logical and Algebraic Methods in Programming, 2021
In this paper, we propose a determinization method of inverted grammar programs by means of context-free expressions (CFEs, for short) which are straightforward extensions (so-called μ-regular expressions) of regular expressions to context-free languages.
Naoki Nishida
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Generalized context‐free grammars and multiple context‐free grammars

Systems and Computers in Japan, 1989
AbstractIt is shown that the class of languages generated by generalized context‐free grammars (gcfg's) introduced by Pollard is exactly the class of recursively enumerable sets. Next, a subclass of gcfg's called multiple context‐free grammars (mcfg's) is introduced and it is shown that the class of languages generated by mcfg's properly contains the ...
Tadao Kasami, Hiroyuki Seki, Mamoru Fujii   +2 more
openaire   +2 more sources

Pullback Grammars Are Context-Free

2008
Following earlier work on pullback rewriting, we describe here the notion of graph grammar relevant to our formalism. We then show that pullback grammars are context-free and provide a surprising example, namely the context-free generation of square grids.
Ly, Olivier, Chen, Rui, Bauderon, Michel
openaire   +3 more sources

Context-Free Categorical Grammars

2009
We define generic categorical notions of rewriting and grammar, using two basic operations, pullback and pushout, and show that these categorical grammars are intrinsically context-free in the sense of Courcelle. We then specialise to various settings, including classical word grammars, hyperedge replacement grammars or node-replacement grammars.
Ly, Olivier, Bauderon, Michel, Chen, Rui
openaire   +2 more sources

Context-Free Grammars with Lookahead

2021
We introduce context-free grammars with lookahead. The grammars are an extension of both context-free grammars and parsing expression grammars, hence we can handle the two grammars in a unified way. To accommodate lookahead, we use a language with lookahead, which is a set of string pairs. We considered the grammar as a system of equations and give the
Takayuki Miyazaki, Yasuhiko Minamide
openaire   +1 more source

Predictors of Context-Free Grammars

SIAM Journal on Computing, 1980
A predictor of a context-free grammar G is a substring of a sentence in $L(G)$ which determines unambiguously the contents of the parse stack immediately before (in top-down parsing) or after (in bottom-up parsing) symbols of the predictor are processed.
openaire   +3 more sources

On the computational power of context-free PC grammar systems [PDF]

Theoretical Computer Science, 2000
It is shown that non-returning parallel communicating grammar systems with λ-free context-free components can generate any recursively enumerable language.
Mandache, Niculae
exaly   +2 more sources