Results 11 to 20 of about 5,181 (248)
Transformation of Turing Machines into Context-Dependent Fusion Grammars [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Context-dependent fusion grammars were recently introduced as devices for the generation of hypergraph languages. In this paper, we show that this new type of hypergraph grammars, where the application of fusion rules is restricted by positive and ...
Aaron Lye
doaj +1 more source
Equality sets for recursively enumerable languages [PDF]
RAIRO - Theoretical Informatics and Applications, 2005 We consider shifted equality sets of the form EG(a, g1 ,g 2 )= {w | g1(w )= ag2(w)} ,w hereg1 and g2 are nonerasing morphisms and a is a letter. We are interested in the family consisting of the languages h(EG(J)), where h is a coding and EG(J )i s as hifted equality set. We prove several closure properties for this family.
Vesa Halava +3 more
openaire +1 more source
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures [PDF]
, 2006 We study the notion of limit sets of cellular automata associated with probability measures (mu-limit sets). This notion was introduced by P. Kurka and A. Maass. It is a refinement of the classical notion of omega-limit sets dealing with the typical long
J. Kari +6 more
core +6 more sources
Membrane division, restricted membrane creation and object complexity in P systems [PDF]
, 2006 We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursively enumerable sets of vectors of non-negative integers, even when no region
Alhazov, Artiom +2 more
core +1 more source
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise [PDF]
Logical Methods in Computer ScienceAngluin's L$^*$ algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively correct (PAC) version substitutes an equivalence query by numerous random ...
Lina Ye +7 more
doaj +1 more source
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages [PDF]
Journal of the ACM, 1980 Fixed point languages and equality languages of homomorphisms and dgsm mappings are consid- ered. Some basic properties of these classes of languages are proved, and it is shown how to use them to represent recursively enumerable sets. In particular, very simple languages are introduced which play the same role for the class of recursively enumerable ...
Engelfriet, J., Rozenberg, G.
openaire +1 more source
The omega-inequality problem for concatenation hierarchies of star-free languages [PDF]
, 2017 The problem considered in this paper is whether an inequality of omega-terms is valid in a given level of a concatenation hierarchy of star-free languages.
Almeida, J., Klíma, O., Kunc, M.
core +2 more sources
On the generating power of regularly controlled bidirection grammars [PDF]
, 1991 RCB-grammars or regularly controlled bidirectional grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion. In addition, the application of these\ud rules is controlled by a regular language.
Asveld, P.R.J. +2 more
core +9 more sources
Computability and human symbolic output [PDF]
, 2013 This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on.
Megill, Jason, Melvin, Tim
core +4 more sources
Godel's Incompleteness Phenomenon - Computationally [PDF]
, 2014 We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some consistent and ...
Salehi, Saeed
core +3 more sources