DLT
2009
13 years 9 months ago
2009
Abstract. We study expansions in non-integer negative base - introduced by Ito and Sadahiro [7]. Using countable automata associated with (-)-expansions, we characterize the case w...
DLT
2009
13 years 9 months ago
2009
DLT
2009
13 years 9 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
DLT
2009
13 years 9 months ago
2009
Abstract. We consider algorithms for approximating context
DLT
2009
13 years 9 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
DLT
2009
13 years 9 months ago
2009
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tili...
DLT
2009
13 years 9 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
DLT
2009
13 years 9 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
DLT
2009
13 years 9 months ago
2009
Cern
DLT
2009
13 years 9 months ago
2009
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...