2 papers
cs.FL2021
Deciding Top-Down Determinism of Regular Tree Languages
Peter Leupold, Sebastian Maneth
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 c…
cs.CC2009
Complexity through the Observation of Simple Systems
Matteo Cavaliere, Peter Leupold
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…