Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
DLT
2009
10 years 11 months ago
On Negative Bases
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...
Christiane Frougny, Anna Chiara Lai
DLT
2009
10 years 11 months ago
Definability in the Infix Order on Words
Oleg V. Kudinov, Victor L. Selivanov
DLT
2009
10 years 11 months ago
Weighted versus Probabilistic Logics
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...
Benedikt Bollig, Paul Gastin
DLT
2009
10 years 11 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu
DLT
2009
10 years 11 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
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...
Hermann Gruber, Markus Holzer
DLT
2009
10 years 11 months ago
Subshifts, Languages and Logic
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...
Emmanuel Jeandel, Guillaume Theyssier
DLT
2009
10 years 11 months ago
On the Complexity of Deciding Avoidability of Sets of Partial Words
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...
Brandon Blakeley, Francine Blanchet-Sadri, Josh Gu...
DLT
2009
10 years 11 months ago
Factorization Forests
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
Mikolaj Bojanczyk
DLT
2009
10 years 11 months ago
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
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...
Makoto Kanazawa
books