Results 1 to 10 of about 11,168 (223)
ACGtk: A Toolkit for Developing and Running Abstract Categorial Grammars
Fuji International Symposium on Functional and Logic Programming. Abstract categorial grammars (ACGs) is an expressive grammatical framework whose formal properties have been extensively studied. While it can provide its own account, as a grammar, of linguistic phenomena, it is known to encode several grammatical ...
Maxime Guillaume +2 more
semanticscholar +1 more source
Constraint Design Rewriting [PDF]
, 2013 We propose an algebraic approach to the design and transformation of constraint networks, inspired by Architectural Design Rewriting. The approach can be understood as (i) an extension of ADR with constraints, and (ii) an application of ADR to the design
Bruni, Roberto +2 more
core
Graph Transformations and Game Theory: A Generative Mechanism for Network Formation [PDF]
, 2008 Many systems can be described in terms of networks with characteristic structural properties. To better understand the formation and the dynamics of complex networks one can develop generative models.
Cavaliere, Matteo +2 more
core
Formal Languages in Dynamical Systems [PDF]
, 1993 We treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal language.
Troll, G.
core +1 more source
Controlled Rewriting Using Productions and Reductions [PDF]
, 1988 We investigate context-free grammars the rules of which can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. We distinguish several modes of derivation for this kind of grammar.
Hogendorp, Jan Anne
core +2 more sources
Separating Dependency from Constituency in a Tree Rewriting System
, 1997 In this paper we present a new tree-rewriting formalism called Link-Sharing Tree Adjoining Grammar (LSTAG) which is a variant of synchronous TAGs. Using LSTAG we define an approach towards coordination where linguistic dependency is distinguished from ...
Sarkar, Anoop
core +3 more sources
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement
, 2009 Recently, it has been shown that every recursively enumerable language can be generated by a scattered context grammar with no more than three nonterminals. However, in that construction, the maximal number of nonterminals simultaneously rewritten during
A. Meduna +16 more
core +2 more sources
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies [PDF]
, 2013 Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form. In general, parsing with SCFGs takes space and time polynomial in the length of
Crescenzi, Pierluigi +4 more
core
Explicit Calculation of Structural Commutation Relations for Stochastic and Dynamical Graph Grammar Rule Operators in Biological Morphodynamics. [PDF]
Front Syst Biol, 2022 Mjolsness E.
europepmc +1 more source
On Infinite Words Determined by Indexed Languages
, 2014 We characterize the infinite words determined by indexed languages. An infinite language $L$ determines an infinite word $\alpha$ if every string in $L$ is a prefix of $\alpha$.
Smith, Tim
core +1 more source