Sciweavers

349 search results - page 10 / 70
» The Finite and the Infinite
Sort
View
TSP
2010
13 years 2 months ago
Algebraic signal processing theory: sampling for infinite and finite 1-D space
We derive a signal processing framework, called space signal processing, that parallels time signal processing. As such, it comes in four versions (continuous/discrete, infinite/fi...
Jelena Kovacevic, Markus Püschel
CSR
2010
Springer
13 years 10 months ago
Sofic and Almost of Finite Type Tree-Shifts
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
Nathalie Aubrun, Marie-Pierre Béal
ICALP
2009
Springer
14 years 7 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal
FOSSACS
2008
Springer
13 years 9 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
CSL
2006
Springer
13 years 7 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin