Author of the publication

A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.

, , and . COCOON, volume 1276 of Lecture Notes in Computer Science, page 393-402. Springer, (1997)

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

A complex event processing for large-scale M2M services and its performance evaluations., , , and . DEBS, page 336-339. ACM, (2015)A scalable complex event processing system and evaluations of its performance., , , , , and . DEBS, page 123-126. ACM, (2012)Undecidability Results for Monoids with Linear-Time Decidable Word Problems., , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 278-289. Springer, (2000)The Homological Finiteness Property FP1 and Finite Generation of Monoids.. Int. J. Algebra Comput., 17 (3): 593-605 (2007)Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid., and . Int. J. Algebra Comput., 12 (1-2): 247-283 (2002)A novel lattice structure of M-channel paraunitary filter banks., and . ISCAS (5), page 4293-4296. IEEE, (2005)On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids., and . Int. J. Algebra Comput., 11 (3): 391-403 (2001)Repetitiveness of D0L-Languages Is Decidable in Polynomial Time., and . MFCS, volume 1295 of Lecture Notes in Computer Science, page 337-346. Springer, (1997)Cross-Sections for Finitely Presented Monoids with Decidable Word Problems., , and . RTA, volume 1232 of Lecture Notes in Computer Science, page 53-67. Springer, (1997)A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet., , and . COCOON, volume 1276 of Lecture Notes in Computer Science, page 393-402. Springer, (1997)