( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tightening the Complexity of Equivalence Problems for Commutative Grammars.

, и . STACS, том 47 из LIPIcs, стр. 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Rijcklof Hofman

Helga Hofman

Dirk Hofman

Klaus Peter Hofman

Hana Hofman-Hüther

 

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

Reachability Problem for Weak Multi-Pushdown Automata., , и . Logical Methods in Computer Science, (2013)Shortest paths in one-counter systems., , , , и . Log. Methods Comput. Sci., (2019)Acyclic Petri and Workflow Nets with Resets., , , , и . FSTTCS, том 284 из LIPIcs, стр. 16:1-16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Shortest paths in one-counter systems., , , , и . CoRR, (2015)Linear equations for unordered data vectors., и . CoRR, (2021)Reachability Problem for Weak Multi-Pushdown Automata., , и . CONCUR, том 7454 из Lecture Notes in Computer Science, стр. 53-68. Springer, (2012)Timed Basic Parallel Processes., , и . CONCUR, том 140 из LIPIcs, стр. 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Separability by Short Subsequences and Subwords., и . ICDT, том 31 из LIPIcs, стр. 230-246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Unboundedness Problems for Languages of Vector Addition Systems., , и . ICALP, том 107 из LIPIcs, стр. 119:1-119:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A lower bound for the coverability problem in acyclic pushdown VAS., , , , , и . Inf. Process. Lett., (2021)