نتایج جستجو برای: markov chains model
تعداد نتایج: 2202330 فیلتر نتایج به سال:
Journal:
:Journal of Computer and System Sciences
2023
Unambiguous automata are nondeterministic in which every word has at most one accepting run. In this paper we give a polynomial-time algorithm for model checking discrete-time Markov chains against ω-regular specifications represented as unambiguous automata. We furthermore show that the complexity of problem lies NC: subclass P comprising those problems solvable poly-logarithmic parallel time....
Journal:
:Journal of Mathematical Analysis and Applications
1963
Journal:
:Combinatorics, Probability and Computing
2017
Journal:
:Journal of the Mathematical Society of Japan
2004
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید