Results 1 to 10 of about 9,918 (52)
Turchin's Relation for Call-by-Name Computations: A Formal Approach [PDF]
, 2016 Supercompilation is a program transformation technique that was first described by V. F. Turchin in the 1970s. In supercompilation, Turchin's relation as a similarity relation on call-stack configurations is used both for call-by-value and call-by-name ...
Nepeivoda, Antonina
core +16 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.
F. Sweety +3 more
openaire +1 more source
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
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 +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
Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars [PDF]
, 2011 The collecting semantics of a program defines the strongest static property of interest. We study the analysis of the collecting semantics of higher-order functional programs, cast as left-linear term rewriting systems.
Kochems, Jonathan, Ong, C.H. Luke
core +1 more source
Linear context-free rewriting systems and deterministic tree-walking transducers [PDF]
, 1992 We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic tree- walking transducers.
Weir, David
core +2 more sources
Finite State Methods in Morphological Analysis of Runyakitara Verbs
Nordic Journal of African Studies, 2010 Previously, there has been a lack for an automatic analyser and generator for the word forms of Runyakitara. In this paper, we present a computational model for grammatical Runyakitara verbs.
Fridah Katushemererwe, Thomas Hanneforth
doaj +1 more source
On external presentations of infinite graphs [PDF]
, 2009 The vertices of a finite state system are usually a subset of the natural numbers. Most algorithms relative to these systems only use this fact to select vertices. For infinite state systems, however, the situation is different: in particular, for such
Morvan, Christophe
core +6 more sources
Iso-array rewriting P systems with context-free iso-array rules [PDF]
, 2014 A new computing model called P system is a highly distributed and parallel theoretical model, which is proposed in the area of membrane computing. Ceterchi et al.
Bhuvaneswari, K. +4 more
core +1 more source