Results 41 to 50 of about 283,476 (338)
The Triple-Pair Construction for Weighted ω-Pushdown Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Let S be a complete star-omega semiring and Sigma be an alphabet. For a weighted omega-pushdown automaton P with stateset 1...n, n greater or equal to 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule pair ((S ...
Manfred Droste +2 more
doaj +1 more source
Expressive Power of Hypergraph Lambek Grammars [PDF]
arXiv, 2023 Hypergraph Lambek grammars (HL-grammars) is a novel logical approach to generating graph languages based on the hypergraph Lambek calculus. In this paper, we establish a precise relation between HL-grammars and hypergraph grammars based on the double pushout (DPO) approach: we prove that HL-grammars generate the same class of languages as DPO grammars ...
arxiv
Information and Control, 1978 In this paper we develop a theory of context-free graph grammars. Formal properties of such grammars are proven, with particular attention to graph language recognizability.
Pierluigi Della Vigna, GHEZZI, CARLO
openaire +1 more source
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
Data-oriented parsing with discontinuous constituents and function tags
Journal of Language Modelling, 2016 Statistical parsers are e ective but are typically limited to producing projective dependencies or constituents. On the other hand, linguisti- cally rich parsers recognize non-local relations and analyze both form and function phenomena but rely on ...
Andreas van Cranenburgh +2 more
doaj +1 more source
Superregular grammars do not provide additional explanatory power but allow for a compact analysis of animal song [PDF]
Royal Society Open Science, 2019 A pervasive belief with regard to the differences between human language and animal vocal sequences (song) is that they belong to different classes of computational complexity, with animal song belonging to regular languages, whereas human language is ...
T. Morita, H. Koda
doaj +1 more source
Pure 2D picture grammars and languages [PDF]
, 2009 A new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is introduced based on the notion of pure context-free string grammar. The rectangular picture generative power of this 2D grammar model is investigated.
Atulya K. Nagar +37 more
core +2 more sources
Inductive Synthesis of Cover-Grammars with the Help of Ant Colony Optimization
Foundations of Computing and Decision Sciences, 2016 A cover-grammar of a finite language is a context-free grammar that accepts all words in the language and possibly other words that are longer than any word in the language.
Wieczorek Wojciech
doaj +1 more source
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components.
Erzsébet Csuhaj-Varjú, György Vaszil
doaj +1 more source
Cooperation in context-free grammars
Theoretical Computer Science, 1997 AbstractA new dynamical measure of the descriptional complexity for context-free grammars and languages, namely the degree of cooperation, is introduced and studied. This measure is connected with respect to both families of languages considered, namely the regular and context-free languages.
Jürgen Dassow +2 more
openaire +2 more sources