124 search results - page 10 / 25 » The Undecidability of the Generalized Collatz Problem |
ACTA
2002
13 years 7 months ago
2002
We consider XML documents described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properties...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automa...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
CATS
2007
13 years 8 months ago
2007
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...