Author of the publication

State Complexity of Prefix Distance.

, , and . CIAA, volume 9223 of Lecture Notes in Computer Science, page 238-249. Springer, (2015)

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

Conjugate word blending: formal model and experimental implementation by XPCR., , , , , and . Nat. Comput., 20 (4): 647-658 (2021)Quasi-Distances and Weighted Finite Automata., , and . DCFS, volume 9118 of Lecture Notes in Computer Science, page 209-219. Springer, (2015)State Complexity of Neighbourhoods and Approximate Pattern Matching., , and . Int. J. Found. Comput. Sci., 29 (2): 315-329 (2018)Outfix-Guided Insertion - (Extended Abstract)., , , and . DLT, volume 9840 of Lecture Notes in Computer Science, page 102-113. Springer, (2016)State Complexity of Neighbourhoods and Approximate Pattern Matching., , and . DLT, volume 9168 of Lecture Notes in Computer Science, page 389-400. Springer, (2015)Distances Between Languages: Algorithms and Descriptional Complexity.. Queen's University at Kingston, Ontario, Canada, (2017)Consensus string problem for multiple regular languages., , , and . Inf. Comput., (2021)Closest Substring Problems for Regular Languages., , , and . DLT, volume 11088 of Lecture Notes in Computer Science, page 392-403. Springer, (2018)Quasi-Distances and Weighted Finite Automata., , and . The Role of Theory in Computer Science, page 135-152. World Scientific, (2017)State Complexity of Prefix Distance of Subregular Languages., , and . J. Autom. Lang. Comb., 22 (1-3): 169-188 (2017)