Results 41 to 50 of about 170,686 (340)
On the Order Type of Scattered Context-Free Orderings [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than ω^2, then its order type is effectively computable.
Kitti Gelle, Szabolcs Iván
doaj +1 more source
On multiple context-free grammars
Theoretical Computer Science, 1991 This paper discusses some generalizations of context free grammars. The resulting languages lie between the class of context free languages and the class of context sensitive languages. The paper investigates and establishes containment relations, many of them strict, between the newly introduced classes of languages.
Mamoru Fujii +3 more
openaire +3 more sources
An Online Algorithm for Lightweight Grammar-Based Compression
Algorithms, 2012 Grammar-based compression is a well-studied technique to construct a context-free grammar (CFG) deriving a given text uniquely. In this work, we propose an online algorithm for grammar-based compression.
Masayuki Takeda +2 more
doaj +1 more source
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
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
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
Acta Cybernetica, 2015 Jungles generalize trees by sharing subtrees and allowing garbage. It is shown that IO context-free tree grammars generate the same jungle languages as context-free jungle grammars.
Drewes, F., Engelfriet, J.
openaire +3 more sources
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
Computer-assisted i‘raab of Arabic sentences for teaching grammar to students
Journal of King Saud University: Computer and Information Sciences, 2022 The end-case analysis of Arabic sentences is one of the keys to their meaning. This process is called i‘raab, a daunting task for the students. The outcome of the analysis is twofold: (a) placing a proper diacritical marking on the end-cases of ...
Zarah M. Mannaa +2 more
doaj +1 more source
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