Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Leupold, Peter"'
Autor:
Leupold, Peter, Maneth, Sebastian
It is well known that for a regular tree language it is decidable whether or not it can be recognized by a deterministic top-down tree automaton (DTA). However, the computational complexity of this problem has not been studied. We show that for a giv
Externí odkaz:
http://arxiv.org/abs/2107.03174
Autor:
Cavaliere, Matteo, Leupold, Peter
Publikováno v:
EPTCS 1, 2009, pp. 22-30
We survey work on the paradigm called "computing by observing." Its central feature is that one considers the behavior of an evolving system as the result of a computation. To this end an observer records this behavior. It has turned out that the obs
Externí odkaz:
http://arxiv.org/abs/0906.3332
Publikováno v:
In Information and Computation March 2011 209(3):471-485
Autor:
Cavaliere, Matteo, Leupold, Peter
Publikováno v:
In Theoretical Computer Science 2011 412(1):113-123
Autor:
Leupold, Peter1 Peter.Leupold@web.de
Publikováno v:
Minds & Machines. Sep2018, Vol. 28 Issue 3, p427-444. 18p. 1 Diagram.
Autor:
Leupold, Peter
Most of the well-known language classes contain very different languages that often have no words at all in common. Therefore it might seem improbable at first sight, that there could be a language non-trivially sharing infinitely many words with eac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0dfb9a752c46698252634378130997b8
Publikováno v:
In Theoretical Computer Science 2005 330(2):205-220
Publikováno v:
In Discrete Applied Mathematics 2005 146(3):301-310
Autor:
Cavaliere, Matteo, Leupold, Peter *
Publikováno v:
In Theoretical Computer Science 2004 321(2):233-248