Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Zetzsche, Stefan"'
Autor:
Zetzsche, Stefan, Rozowski, Wojciech
Regular expressions are commonly understood in terms of their denotational semantics, that is, through formal languages -- the regular languages. This view is inductive in nature: two primitives are equivalent if they are constructed in the same way.
Externí odkaz:
http://arxiv.org/abs/2409.09889
Autor:
Zetzsche, Stefan
Many methods for the verification of complex computer systems require the existence of a tractable mathematical abstraction of the system, often in the form of an automaton. In reality, however, such a model is hard to come up with, in particular man
Externí odkaz:
http://arxiv.org/abs/2308.04222
Autor:
Zetzsche, Stefan
We discuss generalised duality theory for monoidal categories and its applications to the categories of exact endofunctors, graded vector spaces, and topological vector spaces.
Comment: Master thesis
Comment: Master thesis
Externí odkaz:
http://arxiv.org/abs/2301.10039
Autor:
Zetzsche, Stefan
Tournaments are graphs obtained by assigning a direction for every edge in an undirected complete graph. We give a formula for the number of isomorphism classes of vertex-transitive tournaments with prime order. For that, we introduce Cayley tourname
Externí odkaz:
http://arxiv.org/abs/2301.09993
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science, Volume 1 - Proceedings of MFPS XXXVIII (February 28, 2023) entics:10505
Guarded Kleene Algebra with Tests (GKAT) is the fragment of Kleene Algebra with Tests (KAT) that arises by replacing the union and iteration operations of KAT with predicate-guarded variants. GKAT is more efficiently decidable than KAT and expressive
Externí odkaz:
http://arxiv.org/abs/2204.14153
Publikováno v:
EPTCS 351, 2021, pp. 296-313
The classical powerset construction is a standard method converting a non-deterministic automaton into a deterministic one recognising the same language. Recently, the powerset construction has been lifted to a more general framework that converts an
Externí odkaz:
http://arxiv.org/abs/2104.13421
It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To tackle th
Externí odkaz:
http://arxiv.org/abs/2010.10223
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science.
Guarded Kleene Algebra with Tests (GKAT) is the fragment of Kleene Algebra with Tests (KAT) that arises by replacing the union and iteration operations of KAT with predicate-guarded variants. GKAT is more efficiently decidable than KAT and expressive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::225d18f5dfd11bcd02892f754a467b0a
https://doi.org/10.46298/entics.10505
https://doi.org/10.46298/entics.10505
