Author of the publication

State Complexity of Prefix Distance of Subregular Languages.

, , and . J. Autom. Lang. Comb., 22 (1-3): 169-188 (2017)

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

Preface., and . Int. J. Found. Comput. Sci., 28 (5): 437-440 (2017)Localized algorithms for redundant readers elimination in RFID networks., , and . IJPEDS, 34 (3): 260-271 (2019)Complexity of input-driven pushdown automata., and . SIGACT News, 45 (2): 47-67 (2014)Unary NFAs with Limited Nondeterminism., , and . SOFSEM, volume 8327 of Lecture Notes in Computer Science, page 443-454. Springer, (2014)Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof., and . Theory Is Forever, volume 3113 of Lecture Notes in Computer Science, page 259-267. Springer, (2004)Decidability of Confluence and Termination of Monadic Term Rewriting Systems.. RTA, volume 488 of Lecture Notes in Computer Science, page 275-286. Springer, (1991)State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism., , and . DCFS, volume 8614 of Lecture Notes in Computer Science, page 330-341. Springer, (2014)The Quotient Operation on Input-Driven Pushdown Automata., and . DCFS, volume 10316 of Lecture Notes in Computer Science, page 299-310. Springer, (2017)Duplications and Pseudo-Duplications., , , , and . UCNC, volume 9252 of Lecture Notes in Computer Science, page 157-168. Springer, (2015)In Memoriam Sheng Yu., and . CIAA, volume 7381 of Lecture Notes in Computer Science, page 1-4. Springer, (2012)