Results 1 to 10 of about 672 (226)
Picture languages: Tiling systems versus tile rewriting grammars [PDF]
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierluigi San Pietro +2 more
exaly +6 more sources
Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars [PDF]
Lecture Notes in Computer Science, 2001 The type of a minimalist grammar (MG) as introduced by Stabler [11,12] provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB-theory to minimalism.
Jens Michaelis
exaly +4 more sources
Understanding patchy landscape dynamics: towards a landscape language. [PDF]
PLoS ONE, 2012 Patchy landscapes driven by human decisions and/or natural forces are still a challenge to be understood and modelled. No attempt has been made up to now to describe them by a coherent framework and to formalize landscape changing rules.
Cédric Gaucherel +4 more
doaj +2 more sources
Partial array-rewriting P systems and basic puzzle partial array grammars [PDF]
AIP Conference Proceedings, 2020 In literature the innovative model of partial array languages and partial array rewriting rules are existing, earlier we have defined regular partial array grammar and context free partial array grammar to generate partial array languages. Here, the concept of basic puzzle partial array grammar is introduced to generate partial array languages.
K Sasikala
exaly +2 more sources
m-Linear Context-Free Rewriting Systems as Abstract Categorial Grammars [PDF]
, 2003 This paper presents a coding of m-linear context-free rewriting systems (m-LCFRS) into abstract categorial grammars (ACG). Thus, it shows the latter formalism, which offers a powerful grammatical framework based on a small set of computational primitives, is able to reach some interesting classes of languages w.r.t. natural language modeling.
de Groote, Philippe, Pogodalla, Sylvain
openaire +2 more sources
Business Rules Definition for Decision Support System Using Matrix Grammar [PDF]
Acta Informatica Pragensia, 2016 This paper deals with formalization of business rules by formal grammars. In our work we focus on methods for high frequency data processing. We process data by using complex event platforms (CEP) which allow to process high volume of data in nearly real
Eva Zámečníková, Jitka Kreslíková
doaj +1 more source
Tractable Lexical-Functional Grammar
Computational Linguistics, 2020 The formalism for Lexical-Functional Grammar (LFG) was introduced in the 1980s as one of the first constraint-based grammatical formalisms for natural language.
Jürgen Wedekind, Ronald M. Kaplan
doaj +1 more source
Prefix probabilities for linear context-free rewriting systems [PDF]
, 2012 We present a novel method for the computation of prefix probabilities for linear context-free rewriting systems. Our approach streamlines previous procedures to compute prefix probabilities for context-free grammars, synchronous context-free grammars and
Satta, Giorgio, Nederhof, Mark Jan
core +2 more sources
Continuous Grammars ; CU-CS-162-79 [PDF]
, 1979 In this paper we continue the study of selective substitution grammars which form a framework for most of the rewriting systems studied in the literature.
Rozenberg, Grzegorz +1 more
core +8 more sources
A Demonstration of the Grrr Graph Rewriting Programming Language [PDF]
, 2000 This paper overviews the graph rewriting programming language, Grrr. The serial graph rewriting strategy is detailed, and key elements of the user interface are described.
Rodgers, Peter, Vidal, Natalia
core +1 more source