( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing the Width of Non-deterministic Automata.

, и . CoRR, (2018)

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.

Michael Kuperberg

Jaap Denissen

Wladimir Denisow

Natalja Denisjuk

Alexander Arnold Denisiuk

 

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

ACME: Automata with Counters, Monoids and Equivalence., и . ATVA, том 8837 из Lecture Notes in Computer Science, стр. 163-167. Springer, (2014)Kleene Algebra with Hypotheses., , , и . FoSSaCS, том 11425 из Lecture Notes in Computer Science, стр. 207-223. Springer, (2019)Deciding the weak definability of Büchi definable tree languages., , , и . CSL, том 23 из LIPIcs, стр. 215-230. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Computing the Width of Non-deterministic Automata., и . CoRR, (2018)Sensing as a Complexity Measure., , и . DCFS, том 10316 из Lecture Notes in Computer Science, стр. 3-15. Springer, (2017)Varieties of Cost Functions., , и . STACS, том 47 из LIPIcs, стр. 30:1-30:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Computing the Width of Non-deterministic Automata., и . Log. Methods Comput. Sci., (2019)Cyclic Proofs for Transfinite Expressions., и . CSL, том 216 из LIPIcs, стр. 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Explorable Automata., и . CSL, том 252 из LIPIcs, стр. 24:1-24:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata., , , , и . CoRR, (2024)