نتایج جستجو برای: determinization

تعداد نتایج: 268  

Journal: :Theoretical Computer Science 2006

1998
Mehryar Mohri

The redundancy and the size of networks in large-vocabulary speech recognition systems can have a critical eeect on their overall performance. We describe the use of two new algorithms: weighted determinization and minimization 12]. These algorithms transform recognition labeled networks into equivalent ones that require much less time and space in large-vocabulary speech recognition. They are ...

Journal: :Fuzzy Sets and Systems 2014
Zorana Jancic Miroslav Ciric

In this paperwe adapt thewell-knownBrzozowskideterminizationmethod to fuzzy automata. Thismethod gives better results than all previously knownmethods for determinization of fuzzy automata developed by Bělohlávek [InformSciences 143 (2002)205–209],Li andPedrycz [FuzzySet Syst 156 (2005)68–92], Ignjatović et al. [Inform Sciences 178 (2008) 164–180], and Jančić et al. [Inform Sciences 181 (2011) ...

Journal: :Electr. Notes Theor. Comput. Sci. 2011
Alexandra Silva Ana Sokolova

We present a sound and complete axiomatization of finite complete trace semantics for generative probabilistic transition systems. Our approach is coalgebraic, which opens the door to axiomatize other types of systems. In order to prove soundness and completeness, we employ determinization and show that coalgebraic traces can be recovered via determinization, a result interesting in itself. The...

2006
Eugene Goldberg

“Determinization” of resolution is usually done by employing a DPLL-like procedure that operates on partial assignments. We introduce a resolution-based SAT-solver that operates on complete assignments and give a theoretical justification for determinizing resolution in such a way. This justification is based on the notion of a point image of a resolution proof. We give experimental results con...

2005
Joachim Klein Christel Baier C. Baier

This paper addresses the problem of generating deterministic ω-automata for formulas of linear temporal logic, which can be solved by applying wellknown algorithms to construct a nondeterministic Büchi automaton for the given formula on which we then apply a determinization algorithm. We study here in detail Safra’s determinization algorithm, present several heuristics that attempt to decrease ...

2017

A central result in the theory of ω-automata is McNaughton's Theorem which states that every Buchi automaton is equivalent to a deterministic Muller automaton. The complexity of McNaughton's algorithm is huge. Safra provided an optimal construction. Safra's algorithm converts a Buchi automaton with n states to a deterministic Rabin automaton with n states. Much e orts have been invested to redu...

Journal: :International Journal of Applied Information Systems 2012

2012
Jan Kretínský Javier Esparza

When dealing with linear temporal logic properties in the setting of e.g. games or probabilistic systems, one often needs to express them as deterministic omega-automata. In order to translate LTL to deterministic omega-automata, the traditional approach first translates the formula to a non-deterministic Büchi automaton. Then a determinization procedure such as of Safra is performed yielding a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید