Zobrazeno 1 - 10
of 329
pro vyhledávání: '"Omega-Regular languages"'
Autor:
Casares, Antonio, Ohlmann, Pierre
In the context of two-player games over graphs, a language $L$ is called positional if, in all games using $L$ as winning objective, the protagonist can play optimally using positional strategies, that is, strategies that do not depend on the history
Externí odkaz:
http://arxiv.org/abs/2401.15384
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Families of DFAs (FDFAs) have recently been introduced as a new representation of $\omega$-regular languages. They target ultimately periodic words, with acceptors revolving around accepting some representation $u\cdot v^\omega$. Three canonical FDFA
Externí odkaz:
http://arxiv.org/abs/2307.07490
Autor:
Angluin, Dana, Fisman, Dana
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 4 (November 8, 2024) lmcs:12283
A characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning algorithm
Externí odkaz:
http://arxiv.org/abs/2209.09336
We consider extensions of monadic second order logic over $\omega$-words, which are obtained by adding one language that is not $\omega$-regular. We show that if the added language $L$ has a neutral letter, then the resulting logic is necessarily und
Externí odkaz:
http://arxiv.org/abs/2002.09393
Runtime Verification (RV) is a lightweight formal technique in which program or system execution is monitored and analyzed, to check whether certain properties are satisfied or violated after a finite number of steps. The use of RV has led to interes
Externí odkaz:
http://arxiv.org/abs/2002.06737
Automata over infinite words, also known as omega-automata, play a key role in the verification and synthesis of reactive systems. The spectrum of omega-automata is defined by two characteristics: the acceptance condition (e.g. B\"uchi or parity) and
Externí odkaz:
http://arxiv.org/abs/2012.14590
Publikováno v:
Logical Methods in Computer Science, Volume 14, Issue 1 (February 14, 2018) lmcs:2624
Families of DFAs (FDFAs) provide an alternative formalism for recognizing $\omega$-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to th
Externí odkaz:
http://arxiv.org/abs/1612.08154
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Liu, Wanwei
We in this paper show that omega regular languages are not closed under infinite union and intersection. As an attempt, we propose to add step variables and quantifiers to temporal logics to enhance the expressiveness of the underlying logic. We also
Externí odkaz:
http://arxiv.org/abs/1603.05426