Author of the publication

A fully compressed pattern matching algorithm for simple collage systems.

, , and . Int. J. Found. Comput. Sci., 16 (6): 1155-1166 (2005)

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

Computing longest single-arm-gapped palindromes in a string., , , , and . CoRR, (2016)Longest Common Subsequence in at Least k Length Order-isomorphic Substrings., , , , , , , , and . CoRR, (2016)Uniform characterizations of polynomial-query learnabilities., , , and . Theor. Comput. Sci., 292 (2): 377-385 (2003)Parameterized DAWGs: Efficient constructions and bidirectional pattern searches., , , , , , , , and . Theor. Comput. Sci., (2022)Ternary directed acyclic word graphs., , , and . Theor. Comput. Sci., 328 (1-2): 97-111 (2004)Permuted Pattern Matching on Multi-track Strings., , , , and . SOFSEM, volume 7741 of Lecture Notes in Computer Science, page 280-291. Springer, (2013)New Variants of Pattern Matching with Constants and Variables., , , and . SOFSEM, volume 10706 of Lecture Notes in Computer Science, page 611-623. Springer, (2018)Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages., , , and . SOFSEM, volume 14519 of Lecture Notes in Computer Science, page 340-354. Springer, (2024)An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars., , and . Developments in Language Theory, volume 3340 of Lecture Notes in Computer Science, page 225-236. Springer, (2004)Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems., , , and . Machine Intelligence 15, page 227-247. Oxford University Press, (1995)