( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Decomposing Permutation Automata.

, , и . CONCUR, том 203 из LIPIcs, стр. 18:1-18:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Constanze Jecker

Ismael Figueroa

Peter Jecker

Margot Jecker

Rami Ismael

 

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

Parikh Automata over Infinite Words., , , и . FSTTCS, том 250 из LIPIcs, стр. 40:1-40:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Aperiodic String Transducers., , и . Int. J. Found. Comput. Sci., 29 (5): 801-824 (2018)Aperiodic String Transducers., , и . DLT, том 9840 из Lecture Notes in Computer Science, стр. 125-137. Springer, (2016)A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct., , , и . Log. Methods Comput. Sci., (2024)Operational complexity and pumping lemmas., и . Acta Informatica, 59 (4): 337-355 (2022)History-deterministic Parikh Automata., , , , и . CoRR, (2022)History-Deterministic Parikh Automata., , , , и . CONCUR, том 279 из LIPIcs, стр. 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Simplified Game of Life: Algorithms and Complexity., , , и . MFCS, том 170 из LIPIcs, стр. 22:1-22:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)New Lower Bounds for Reachability in Vector Addition Systems., , , , и . FSTTCS, том 284 из LIPIcs, стр. 35:1-35:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Regular and Complete Notion of Delay for Streaming String Transducers., , , и . CoRR, (2022)