Results 21 to 30 of about 767,182 (284)
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
Rewrite Closure and CF Hedge Automata [PDF]
, 2012 We introduce an extension of hedge automata called bidimensional context-free hedge automata. The class of unranked ordered tree languages they recognize is shown to be preserved by rewrite closure with inverse-monadic rules.
A. Bouajjani +6 more
core +6 more sources
Dynamic Complexity of Formal Languages [PDF]
, 2008 The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained using quantifier-free first-order updates, with and without auxiliary ...
Gelade, Wouter +2 more
core +6 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
Groups with context-free co-word problem [PDF]
, 2005 The class of co-context-free groups is studied. A co-context-free group is defined as one whose coword problem (the complement of its word problem) is context-free.
Holt, Derek F. +3 more
core +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
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
Groups with poly-context-free word problem [PDF]
, 2010 We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free groups has poly-
Brough, Tara
core +3 more sources