Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Theory of computation ��� Interactive computation"'
Publikováno v:
Logical Methods in Computer Science, 19(1), 15:1-15:32
The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79b53eb81e74c8e91989eaf1e3ecb22c
https://doi.org/10.46298/lmcs-19(1:15)2023
https://doi.org/10.46298/lmcs-19(1:15)2023
An asymptotic lowerbound of Ω((m+n)log n) is established for partition refinement algorithms that decide bisimilarity on labeled transition systems. The lowerbound is obtained by subsequently analysing two families of deterministic transition system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ebaf0bbc70406ac3b4abc031cd1729e
