Results 21 to 30 of about 26,068 (292)
Alternating register automata on finite words and trees [PDF]
, 2012 We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain.
Figueira, Diego
core +4 more sources
Ratio Mathematica, 2019 Within the conceptual framework of number theory, we consider prime numbers and the classic still unsolved problem to find a complete law of their distribution.
Gianfranco Minati
doaj +1 more source
Decidability in the logic of subsequences and supersequences [PDF]
, 2015 We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske.
Karandikar, Prateek +1 more
core +2 more sources
Knowledge to Manage the Knowledge Society: The Concept of Theoretical Incompleteness
Systems, 2016 After having outlined the essential differences between non-complex systems and complex systems we briefly recall the conceptual approaches considered by the pre-complexity General Systems Theory introduced by Von Bertalanffy in 1968 and those of the ...
Gianfranco Minati
doaj +1 more source
Undecidable problems concerning densities of languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In this paper we prove that the question whether a language presented by a context free grammar has density, is undecidable. Moreover we show that there is no algorithm which, given two unambiguous context free grammars on input, decides whether the ...
Jakub Kozik
doaj +1 more source
Number conserving cellular automata: new results on decidability and dynamics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.
Bruno Durand +3 more
doaj +1 more source
Equivalence Problems for Tree Transducers: A Brief Survey [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree transducers, (
Sebastian Maneth
doaj +1 more source
An analytical method for well-formed workflow/Petri net verification of classical soundness
International Journal of Applied Mathematics and Computer Science, 2014 In this paper we consider workflow nets as dynamical systems governed by ordinary difference equations described by a particular class of Petri nets. Workflow nets are a formal model of business processes.
Clempner Julio
doaj +1 more source
Completing the picture for the Skolem Problem on order-4 linear recurrence sequences [PDF]
TheoretiCSFor almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem Problem is indeed
Piotr Bacik
doaj +1 more source
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet [PDF]
Logical Methods in Computer Science, 2008 We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical characterizations.
Alexis Bès
doaj +1 more source