Author of the publication

On the Class of Languages Recognizable by 1-Way Quantum Finite Automata.

, , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 75-86. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Transition Function Complexity of Finite Automata.. DCFS, volume 6808 of Lecture Notes in Computer Science, page 301-313. Springer, (2011)Descriptional and Computational Complexity of the Circuit Representation of Finite Automata.. LATA, volume 10792 of Lecture Notes in Computer Science, page 105-117. Springer, (2018)On the Class of Languages Recognizable by 1-Way Quantum Finite Automata., , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 75-86. Springer, (2001)Boolean Circuit Complexity of Regular Languages.. AFL, volume 151 of EPTCS, page 342-354. (2014)Transition Function Complexity of Finite Automata.. Balt. J. Mod. Comput., (2019)