( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Iterated Uniform Finite-State Transducers.

, , , и . ICTCS, том 2504 из CEUR Workshop Proceedings, стр. 52-57. CEUR-WS.org, (2019)

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.

Beatrice Adamopoulou

Beatrice Klein

Béatrice Lienemann

Beatrice Brunhöber

Beatrice Tühscher

 

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

Guest Column: Quantum Finite Automata: From Theory to Practice., и . SIGACT News, 52 (3): 38-59 (2021)Removing nondeterminism in constant height pushdown automata., , , и . Inf. Comput., (2014)Synthesis of unary quantum automata from periodic events.. University of Turin, Italy, (2003)On leftmost #-Rewriting Systems., и . DCFS, стр. 61-72. University of Prince Edward Island, (2008)Probabilistic vs. Nondeterministic Unary Automata., , , и . NCMA, том 263 из books@ocg.at, стр. 33-44. Austrian Computer Society, (2010)Uniform Circle Formation for Swarms of Opaque Robots with Lights., , и . SSS, том 11201 из Lecture Notes in Computer Science, стр. 317-332. Springer, (2018)On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters., , , , , и . CIAA, том 15015 из Lecture Notes in Computer Science, стр. 208-220. Springer, (2024)Size lower bounds for quantum automata., , и . Theor. Comput. Sci., (2014)Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion., , , и . DCFS, том 12442 из Lecture Notes in Computer Science, стр. 117-129. Springer, (2020)A Regularity Condition for Context-Free Grammars.. Int. J. Found. Comput. Sci., 19 (4): 845-857 (2008)