DLT
2008
13 years 9 months ago
2008
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
DLT
2008
13 years 10 months ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
DLT
2008
13 years 10 months ago
2008
Abstract. Let w be an equality word of two nonperiodic binary morphisms g, h : {a, b} . Suppose that no overflow occurs twice in w and that w contains at least 9 occurrences of a ...
DLT
2008
13 years 10 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
DLT
2008
13 years 10 months ago
2008
Abstract. In a recent paper with L. Q. Zamboni the authors introduced the class of -episturmian words, where is an involutory antimorphism of the free monoid A . In this paper, we...
DLT
2008
13 years 10 months ago
2008
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equ...
DLT
2008
13 years 10 months ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
DLT
2008
13 years 10 months ago
2008
DLT
2008
13 years 10 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
DLT
2008
13 years 10 months ago
2008
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of ...