Results 21 to 30 of about 52,651 (265)
On Separation by Locally Testable and Locally Threshold Testable Languages [PDF]
Logical Methods in Computer Science, 2014 A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally
Thomas Place +2 more
doaj +1 more source
Split-Based Algorithm for Weighted Context-Free Grammar Induction
Applied Sciences, 2021 The split-based method in a weighted context-free grammar (WCFG) induction was formalised and verified on a comprehensive set of context-free languages. WCFG is learned using a novel grammatical inference method. The proposed method learns WCFG from both
Mateusz Gabor +2 more
doaj +1 more source
Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA.
Paola Bonizzoni +2 more
doaj +1 more source
On commutative context-free languages
Journal of Computer and System Sciences, 1987 Let \(\Sigma =\{a_ 1,a_ 2,...,a_ n\}\) be an alphabet and let \(L\subset \Sigma^*\) be the commutative image of \(FP^*\) where F and P are finite subsets of \(\Sigma^*\). If, for any permutation \(\sigma\) of \(\{\) 1,2,...,n\(\}\), \(L\cap a^*_{\sigma (1)}...a^*_{\sigma (n)}\) is context-free, then L is context-free.
Joffroy Beauquier +2 more
openaire +2 more sources
KONTRIBUSI BAHASA ARAB TERHADAP BAHASA INDONESIA
Hunafa: Jurnal Studia Islamika, 2005 The development of a language is not free from the influences of other languages. For example, as an official language, Indonesian language used by Indonesians, is not free from the influences of other languages, either local languages such as Javanese ...
Rusdin Rusdin
doaj +1 more source
Approximation of Weighted Automata with Storage [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We use a non-deterministic variant of storage types to develop a framework for the approximation of automata with storage. This framework is used to provide automata-theoretic views on the approximation of multiple context-free languages and on coarse ...
Tobias Denkinger
doaj +1 more source
Bracketed context-free languages
Journal of Computer and System Sciences, 1967 AbstractA bracketed grammar is a context-free grammar in which indexed brackets are inserted around the right-hand sides of the rules. The language generated by a bracketed grammar is a bracketed language. An algebraic condition is given for one bracketed language to be a subset of another. The intersection and the difference of two bracketed languages
Seymour Ginsburg, Michael A. Harrison
openaire +1 more source
Implicit learning of recursive context-free grammars.
PLoS ONE, 2012 Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed
Martin Rohrmeier +2 more
doaj +1 more source
Logical and Algebraic Characterizations of Rational Transductions [PDF]
Logical Methods in Computer Science, 2019 Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic.
Emmanuel Filiot +2 more
doaj +1 more source
On Parsing Programming Languages with Turing-Complete Parser
Mathematics, 2023 A new parsing method based on the semi-Thue system is described. Similar to, but with more efficient implementation than Markov normal algorithms, it can be used for parsing any recursively enumerable language.
Boštjan Slivnik, Marjan Mernik
doaj +1 more source