27 search results - page 2 / 6 » On Pebble Automata for Data Languages with Decidable Emptine... |
154
click to vote
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
149
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
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 rest...
160
click to vote
CSL
2008
Springer
15 years 6 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
177
click to vote
LICS
2012
IEEE
13 years 6 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
159
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...