Zobrazeno 1 - 10
of 3 771
pro vyhledávání: '"determinization"'
Autor:
Li, Thea
Colcombet and Petri\c{s}an argued that automata may be usefully considered from a functorial perspective, introducing a general notion of "$\mathcal{V}$-automaton" based on functors into $\mathcal{V}$. This enables them to recover different standard
Externí odkaz:
http://arxiv.org/abs/2410.00675
Autor:
Acampora, Renato, Della Monica, Dario, Geatti, Luca, Gigante, Nicola, Montanari, Angelo, Sala, Pietro
Publikováno v:
EPTCS 409, 2024, pp. 5-18
Qualitative timeline-based planning models domains as sets of independent, but interacting, components whose behaviors over time, the timelines, are governed by sets of qualitative temporal constraints (ordering relations), called synchronization rul
Externí odkaz:
http://arxiv.org/abs/2410.22757
For decades, Simultaneous Ascending Auction (SAA) has been the most widely used mechanism for spectrum auctions, and it has recently gained popularity for allocating 5G licenses in many countries. Despite its relatively simple rules, SAA introduces a
Externí odkaz:
http://arxiv.org/abs/2407.11715
Autor:
Martynova, Olga
The number of states and stack symbols needed to determinize nondeterministic input-driven pushdown automata (NIDPDA) working over a fixed alphabet is determined precisely. It is proved that in the worst case exactly 2^{n^2} states are needed to dete
Externí odkaz:
http://arxiv.org/abs/2404.10516
Autor:
Almagor, Shaull, Dafni, Neta
Nondeterministic Discounted-Sum Automata (NDAs) are nondeterministic finite automata equipped with a discounting factor $\lambda>1$, and whose transitions are labelled by weights. The value of a run of an NDA is the discounted sum of the edge weights
Externí odkaz:
http://arxiv.org/abs/2310.09115
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:
Baburin, Ivan, Cotterell, Ryan
In this paper we establish an abstraction of on-the-fly determinization of finite-state automata using transition monoids and demonstrate how it can be applied to bound the asymptotics. We present algebraic and combinatorial properties that are suffi
Externí odkaz:
http://arxiv.org/abs/2308.14077
Autor:
Abolpour, Kh.1 Abolpor_kh@yahoo.com, Shamsizadeh, M.2 shamsizadeh.m@gmail.com
Publikováno v:
Iranian Journal of Fuzzy Systems. 2024, Vol. 21 Issue 1, p173-188. 16p.
Publikováno v:
EPTCS 370, 2022, pp. 49-65
We propose an algorithm for schema-based determinization of finite automata on words and of step-wise hedge automata on nested words. The idea is to integrate schema-based cleaning directly into automata determinization. We prove the correctness of o
Externí odkaz:
http://arxiv.org/abs/2209.10312
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.