Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Peter Leupold"'
Autor:
Peter Leupold, Matteo Cavaliere
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 1, Iss Proc. CSP 2008, Pp 22-30 (2009)
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:
https://doaj.org/article/efb5b04624b34572a13ffdb6319e4602
Autor:
Sebastian Maneth, Peter Leupold
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783030865924
FCT
FCT
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:
https://explore.openaire.eu/search/publication?articleId=doi_________::863b4683d156bb71ba58011e3b2b07a5
https://doi.org/10.1007/978-3-030-86593-1_24
https://doi.org/10.1007/978-3-030-86593-1_24
Autor:
Peter Leupold
Publikováno v:
Minds and Machines. 28:427-444
John Searle raised the question whether all computation is observer-relative. Indeed, all of the common views of computation, be they semantical, functional or causal rely on mapping something onto the states of a physical or abstract process. In ord
Autor:
Peter Leupold
Publikováno v:
International Journal of Foundations of Computer Science. 27:343-357
Idempotency languages are generated from a single word by iterated application of rules of the form [Formula: see text] for natural numbers m and n. We investigate these languages over alphabets of only one or two letters. The conditions under which
Autor:
Peter Leupold, Norbert Hundeshagen
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 48:85-105
The recently introduced model of transducing by observing is compared with traditional models for computing transductions on the one hand and the recently introduced restarting transducers on the other hand. Most noteworthy, transducing observer syst
Publikováno v:
International Journal of Foundations of Computer Science. 23:1277-1289
This work continues investigations on avoidability of languages. We show that the language of primitive non-palindromes is strongly unavoidable for context-free languages that are not linear. This means that every language from this class contains in
Publikováno v:
Information and Computation. 209(3):471-485
Hairpin completion is a formal operation inspired from biochemistry. Here we consider a restricted variant of hairpin completion called bounded hairpin completion. Applied to a word encoding a single stranded molecule x such that either a suffix or a
Autor:
Friedrich Otto, Peter Leupold
Publikováno v:
Fundamenta Informaticae. 112:219-238
We study the McNaughton families of languages that are specified by four different variants of monadic string-rewriting systems: strictly monadic systems, monadic systems, inverse context-free systems, and generalized monadic systems. In the general
Autor:
Peter Leupold, Benedek Nagy
Publikováno v:
Fundamenta Informaticae. 104:71-91
5′ → 3′ WK-automata are Watson-Crick automata whose two heads start on opposite ends of the input word and always run in opposite directions. One full reading in both directions is called a run. We prove that the expressive power of these autom
Autor:
Matteo Cavaliere, Peter Leupold
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 1, Iss Proc. CSP 2008, Pp 22-30 (2009)
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