Author of the publication

The complexity of weakly recognizing morphisms.

, and . RAIRO Theor. Informatics Appl., 53 (1-2): 1-17 (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. 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

The complexity of weakly recognizing morphisms., and . RAIRO Theor. Informatics Appl., 53 (1-2): 1-17 (2019)The Inclusion Problem for Forest Languages under Substitutions., and . CoRR, (2021)Yet another proof of Parikh's Theorem.. CoRR, (2022)Nesting negations in FO2 over infinite words., and . CoRR, (2020)Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words., and . Int. J. Found. Comput. Sci., 34 (2&3): 183-224 (February 2023)Green's Relations in Deterministic Finite Automata., and . Theory Comput. Syst., 63 (4): 666-687 (2019)Conelikes and Ranker Comparisons., and . CoRR, (2021)Conelikes and Ranker Comparisons., and . LATIN, volume 13568 of Lecture Notes in Computer Science, page 359-375. Springer, (2022)Reachability Games and Parity Games., and . ICTAC, volume 13572 of Lecture Notes in Computer Science, page 14-35. Springer, (2022)Deciding FO2 Alternation for Automata over Finite and Infinite Words., and . DLT, volume 12811 of Lecture Notes in Computer Science, page 180-191. Springer, (2021)