• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Computer Science Explained

Computer Science Explained

Paperback

General Computers

ISBN10: 6209582737
ISBN13: 9786209582738
Publisher: LAP Lambert Academic Publishing
Published: Feb 3 2026
Pages: 112
Weight: 0.35
Height: 0.27 Width: 6.00 Depth: 9.00
Language: English
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.

Also from

Syzdykov, Mirzakhmet

Also in

General Computers