( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Unidirectional Channel Systems Can Be Tested.

, , и . IFIP TCS, том 7604 из Lecture Notes in Computer Science, стр. 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.

Prateek Saxena

 

Другие публикации лиц с тем же именем

The height of piecewise-testable languages and the complexity of the logic of subwords., и . Logical Methods in Computer Science, (2019)Cutting through Regular Post Embedding Problems., и . CSR, том 7353 из Lecture Notes in Computer Science, стр. 229-240. Springer, (2012)The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering., , , , и . CoRR, (2019)Generalized Post Embedding Problems., и . Theory Comput. Syst., 56 (4): 697-716 (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)Decidability in the Logic of Subsequences and Supersequences., и . FSTTCS, том 45 из LIPIcs, стр. 84-97. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On the index of Simon's congruence for piecewise testability., и . CoRR, (2013)The Height of Piecewise-Testable Languages with Applications in Logical Complexity., и . CSL, том 62 из LIPIcs, стр. 37:1-37:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On Reachability for Unidirectional Channel Systems Extended with Regular Tests., , и . Log. Methods Comput. Sci., (2015)Cutting Through Regular Post Embedding Problems, и . CoRR, (2011)