Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Computer Science Explained
Angličtina
131 b
30 dní na vrátenie tovaru
The author of this novel theoretical book has a wide knowledge and more than ten years of steady research in the field of automata and complexity theory.The term "state complexity" comes from the fact that the state could be a formation of the absorbing complexity as to the date of our successful experience there were no best- known solutions for the regular expression matching with extended operators like intersection, subtraction and complement, which is better known as a "membership problem" - we present a delicate "proof of concept" on the scientific work which lays between classical notation of automata and complexity theory.We go beyond all of the classical "tabu" and "notations" which show that with respect to our current asymptotic result, there is no border between the algorithm to be linear and in general accepting on any combination of automata.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoAhoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?