Results 191 to 200 of about 184,770 (243)

Rosetta Statements: simplifying FAIR knowledge graph construction with a user-centred approach. [PDF]

Database (Oxford)
Vogt L, Farfar KE, Karanth P, Konrad M, Oelen A, Prinz M, Strömert P.   +6 more
europepmc   +1 more source

Simulating real-life scenarios to better understand the spread of diseases under different contexts. [PDF]

Sci Rep
Blanco R, Patow G, Pelechano N.
europepmc   +1 more source

Programmed grammars and their relation to the LBA problem

Acta Informatica, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Bordihn, Markus Holzer
exaly   +6 more sources

Some of the next articles are maybe not open access.

Related searches:

On context-free programmed grammars

Computer Languages, Systems and Structures, 1989
Abstract We develop a definition of a deterministic and decidable class of context-free programmed grammars, the SPG class. A table-driven parsing algorithm that operates in quadratic time and an algorithm to produce the parsing table from a given grammar are included.
exaly   +2 more sources

The power of programmed grammars with graphs from various classes

Journal of Applied Mathematics and Computing, 2006
Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs.
Jürgen Dassow, Benedek Nagy, Mihai Ionescu   +2 more
exaly   +2 more sources

Grammar programming in TXL

Proceedings. Second IEEE International Workshop on Source Code Analysis and Manipulation, 2003
Syntactic analysis forms a foundation of many source analysis and reverse engineering tools. However, a single grammar is not always appropriate for all source analysis and manipulation tasks. Small changes to the grammar can make the programs used to accomplish these tasks simpler and more straightforward.
Thomas R. Dean, James R. Cordy, Andrew J. Malton, Kevin A. Schneider   +3 more
openaire   +1 more source

Programmed Grammars and Classes of Formal Languages

Journal of the ACM, 1969
exaly   +2 more sources

Extending Program Synthesis Grammars for Grammar-Guided Genetic Programming

2018
Program synthesis is a problem domain that due to its importance is tackled by many different fields, one being Genetic Programming. Two variants, Grammar-Guided Genetic Programming (G3P) and PushGP, have been applied to a vast general program synthesis benchmark suite and solved a variety of problems although with varying success rates.
Stefan Forstenlechner, David Fagan, Miguel Nicolau, Michael O'Neill 0001   +3 more
openaire   +1 more source

Graph grammars and logic programming

2005
In this paper we investigate the relationship between the algebraic definition of graph grammars and logic programming. In particular, we show that the operational semantics of any logic program can be faithfully simulated by a particular context-free hypergraph grammar.
CORRADINI, ANDREA, MONTANARI, UGO GIOVANNI ERASMO, Rossi F, Ehrig H, Loewe M.   +4 more
openaire   +2 more sources

Grammar-based immune programming

Natural Computing, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heder S. Bernardino, Helio J. C. Barbosa
openaire   +2 more sources