47 search results - page 6 / 10 » On the Recognizability of Self-generating Sets |
162
click to vote
MFCS
1998
Springer
15 years 10 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
172
click to vote
ATVA
2006
Springer
15 years 9 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
173
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
140
click to vote
ICDCSW
2005
IEEE
15 years 11 months ago
2005
IEEE
We present a set of graphical user interface elements, called widgets, for 2-dimensional visual codes. The proposed widgets are suitable for printing on paper as well as showing o...
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...