Results 31 to 40 of about 494,097 (364)
A 15-Year Retrospective on Insertion-Deletion Systems: Progress, Evolution, and Future Directions [PDF]
Computer Science Journal of MoldovaThis paper offers a comprehensive retrospective on the development and results in the field of insertion-deletion systems over the past 15 years, building upon an earlier foundational overview from 2010.
Artiom Alhazov +2 more
doaj +1 more source
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages [PDF]
, 2007 The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the
Glasser, Christian +2 more
core +7 more sources
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
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
Da metamatemática para a ciência cognitiva From metamathematics to Cognitive Science
Trans/Form/Ação, 1999 Neste artigo, propõe-se uma configuração possível para a transição histórico-filosófica de temas investigados no domínio da metamatemática para o domínio da Ciência Cognitiva funcionalista neurocomputacional. A descrição de tal transição é feita por meio
Henrique de Morais Ribeiro
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
DECIDABILITY IN LOCAL AND GLOBAL FIELDS
International Congress of Mathematicans, 2019 This lecture highlights some recent advances on classical decidability issues in local and global (cid:28)elds. 2010 Mathematics Subject Classi(cid:28)cation: Primary 11U05; Secondary: 03B25, 11F85, 12J10, 12L05.
J. Koenigsmann
semanticscholar +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
Who Decides Who Decides? [PDF]
The Hastings Center Report, 1977 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/90544/1/3561853 ...
openaire +3 more sources
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