نتایج جستجو برای: determinization
تعداد نتایج: 268 فیلتر نتایج به سال:
The two determinization procedures of Safra and MullerSchupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.
We consider weighted tree automata (wta) over strong bimonoids and their initial algebra semantics run semantics. There are wta for which these different; however, bottom-up deterministic semirings, the difference vanishes. A is crisp-deterministic if it each transition by one of unit elements bimonoid. prove that class languages recognized same as recognizable step mappings. Moreover, we inves...
We present a disambiguation algorithm for weighted automata. The algorithm admits two main stages: a pre-disambiguation stage followed by a transition removal stage. We give a detailed description of the algorithm and the proof of its correctness. The algorithm is not applicable to all weighted automata but we prove sufficient conditions for its applicability in the case of the tropical semirin...
Checking whether one formal language is included in another is vital to many verification tasks. In this paper, we provide solutions for checking the inclusion of the languages given by visibly pushdown automata over both finite and infinite words. Visibly pushdown automata are a richer automaton model than the classical finite-state automata, which allows one, e.g., to reason about the nesting...
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebraic view on systems to derive, in a uniform way, abstract procedures for checking behavioural equivalence in coalgebras, which perform (a combination of) minimization and determinization. First, we show that for coalgebra...
We present a uniform construction for converting ω-automata with arbitrary acceptance conditions to equivalent deterministic parity automata (DPW). Given a non-deterministic automaton with n states, our construction gives a DPW with at most 2 2 logn) states and O(n) parity indices. The corresponding bounds when the original automaton is deterministic are O(n!) and O(n), respectively. Our algori...
Monte-Carlo Tree Search (MCTS) is a class of game tree search algorithms that have recently proven successful for deterministic games of perfect information, particularly the game of Go. Determinization is an AI technique for making decisions in stochastic games of imperfect information by analysing several instances of the equivalent deterministic game of perfect information. In this paper we ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید