( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
State Complexity of Single-Word Pattern Matching in Regular Languages.

, , и . DCFS, том 11612 из Lecture Notes in Computer Science, стр. 86-97. Springer, (2019)

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.

Andrew Davies

Sergio Davies

Guy Davies

Caroline Davies

Michael Davies

 

Другие публикации лиц с тем же именем

Quotient Complexities of Atoms in Regular Ideal Languages., и . CoRR, (2015)Most Complex Deterministic Union-Free Regular Languages., и . DCFS, том 10952 из Lecture Notes in Computer Science, стр. 37-48. Springer, (2018)Most Complex Non-returning Regular Languages., и . DCFS, том 10316 из Lecture Notes in Computer Science, стр. 89-101. Springer, (2017)Square, Power, Positive Closure, and Complementation on Star-Free Languages., и . DCFS, том 11612 из Lecture Notes in Computer Science, стр. 98-110. Springer, (2019)Multilingual Thesauri For The Modern World - No Ideal Solution?, и . Journal of Documentation, (2001)State Complexity of Single-Word Pattern Matching in Regular Languages., , и . DCFS, том 11612 из Lecture Notes in Computer Science, стр. 86-97. Springer, (2019)Most Complex Non-Returning Regular Languages., и . Int. J. Found. Comput. Sci., 30 (6-7): 921-957 (2019)Most Complex Regular Ideal Languages., , и . Discret. Math. Theor. Comput. Sci., (2016)Algebraic Approaches to State Complexity of Regular Operations.. University of Waterloo, Ontario, Canada, (2019)base-search.net (ftunivwaterloo:oai:uwspace.uwaterloo.ca:10012/15203).A New Technique for Reachability of States in Concatenation Automata.. DCFS, том 10952 из Lecture Notes in Computer Science, стр. 75-87. Springer, (2018)