81 search results - page 6 / 17 » Closure of Language Classes Under Bounded Duplication |
MSCS
2010
13 years 6 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
IANDC
2011
13 years 2 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
MFCS
2004
Springer
14 years 26 days ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...