Author of the publication

Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017.

, and . J. Comput. Syst. Sci., (2020)

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 linear nature of pseudowords., , , and . CoRR, (2017)Pseudovariety Joins involving -Trivial Semigroups., , and . Int. J. Algebra Comput., 9 (1): 99-112 (1999)Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017., and . J. Comput. Syst. Sci., (2020)A Characterization for Decidable Separability by Piecewise Testable Languages., , , , and . Discret. Math. Theor. Comput. Sci., (2017)On the Decidability of the Membership Problem of the Pseudovariety J∨B.. Int. J. Algebra Comput., 5 (1): 47-64 (1995)Adding Successor: A Transfer Theorem for Separation and Covering., and . ACM Trans. Comput. Log., 21 (2): 9:1-9:45 (2020)Infinite-State High-Level MSCs: Model-Checking and Realizability., , , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 657-668. Springer, (2002)An automata-theoretic approach to the word problem for omega -terms over R., and . Theor. Comput. Sci., 370 (1-3): 131-169 (2007)Description and analysis of a bottom-up DFA minimization algorithm., and . Inf. Process. Lett., 107 (2): 52-59 (2008)A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation., and . FSTTCS, volume 250 of LIPIcs, page 43:1-43:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)