Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Dietrich Kuske"'
Autor:
Peter Habermehl, Dietrich Kuske
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 3 (2023)
We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are given as term
Externí odkaz:
https://doaj.org/article/d8220c8b761149bf92c7bae7ba46713d
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 226, Iss Proc. GandALF 2016, Pp 213-227 (2016)
We consider simulation games played between Spoiler and Duplicator on two Büchi automata in which the choices made by Spoiler can be buffered by Duplicator in several buffers before she executes them on her structure. We show that the simulation gam
Externí odkaz:
https://doaj.org/article/39f73ffc0f0b4dbc909d69b94230ca7a
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 220, Iss Proc. Cassting 2016/SynCoP'16, Pp 27-38 (2016)
We consider simulation games played between Spoiler and Duplicator on two Büchi automata in which the choices made by Spoiler can be buffered by Duplicator in two different buffers before she executes them on her structure. Previous work on such gam
Externí odkaz:
https://doaj.org/article/6366ae6d732242a683ef5ba5268beb84
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 3 (2018)
We study word structures of the form $(D,
Externí odkaz:
https://doaj.org/article/1b50d6d5c92e4ebd807a7931c16fbe8d
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 3 (2010)
We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an ev
Externí odkaz:
https://doaj.org/article/d3bc6eae47904d019d1f2ed2ff037659
Autor:
Dietrich Kuske, Christian Schwarz
Publikováno v:
Acta Informatica. 60:79-100
This paper considers the structure consisting of the set of all words over a given alphabet together with the subword relation, regular predicates, and constants for every word. We are interested in the counting extension of first-order logic by thre
Publikováno v:
Information and Computation
Information and Computation, Elsevier, 2018, 262, pp.280-310. ⟨10.1016/j.ic.2018.09.008⟩
Information and Computation, Elsevier, 2018, 262, pp.280-310. ⟨10.1016/j.ic.2018.09.008⟩
International audience; Multi-buffer simulation is a refinement of fair simulation between two nonde-terministic B ¨ uchi automata (NBA). It is characterised by a game in which letters get pushed to and taken from FIFO buffers of bounded or unbounde
Autor:
Dietrich Kuske
Publikováno v:
Developments in Language Theory ISBN: 9783030815073
DLT
DLT
Second-order finite automata, introduced recently by Andrade de Melo and de Oliveira Oliveira, represent classes of languages. Since their semantics is defined by a synchronized rational relation, they can be studied using the theory of automatic str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d885779bd8ccc5ec325109605d39d87a
https://doi.org/10.1007/978-3-030-81508-0_20
https://doi.org/10.1007/978-3-030-81508-0_20