Author of the publication

Unidirectional Channel Systems Can Be Tested.

, , and . IFIP TCS, volume 7604 of Lecture Notes in Computer Science, page 149-163. Springer, (2012)

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 Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering., , , , and . CoRR, (2019)Cutting through Regular Post Embedding Problems., and . CSR, volume 7353 of Lecture Notes in Computer Science, page 229-240. Springer, (2012)The height of piecewise-testable languages and the complexity of the logic of subwords., and . Logical Methods in Computer Science, (2019)Generalized Post Embedding Problems., and . Theory Comput. Syst., 56 (4): 697-716 (2015)Decidability in the Logic of Subsequences and Supersequences., and . FSTTCS, volume 45 of LIPIcs, page 84-97. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Subwords : automata, embedding problems, and verification. (Sous-mots : automates, problèmes de plongement, et vérification).. École normale supérieure de Cachan, France, (2015)Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences., and . CoRR, (2015)Cutting Through Regular Post Embedding Problems, and . CoRR, (2011)The Height of Piecewise-Testable Languages with Applications in Logical Complexity., and . CSL, volume 62 of LIPIcs, page 37:1-37:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the index of Simon's congruence for piecewise testability., and . CoRR, (2013)