( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.

, , и . STACS, том 2010 из Lecture Notes in Computer Science, стр. 305-316. Springer, (2001)

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

Beatrice Henk

Beatrice Brunhöber

Béatrice Lienemann

 

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

A Regularity Condition for Context-Free Grammars.. Int. J. Found. Comput. Sci., 19 (4): 845-857 (2008)Quantum finite automata: Advances on Bertoni's ideas., , и . Theor. Comput. Sci., (2017)The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata., , , и . DCFS, том 6808 из Lecture Notes in Computer Science, стр. 80-92. Springer, (2011)Upper Bounds on the Size of One-Way Quantum Finite Automata., и . ICTCS, том 2202 из Lecture Notes in Computer Science, стр. 123-135. Springer, (2001)Structural Complexity and Neural Networks., и . WIRN, том 2486 из Lecture Notes in Computer Science, стр. 190-215. Springer, (2002)Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion., , , и . DCFS, том 12442 из Lecture Notes in Computer Science, стр. 117-129. Springer, (2020)Size lower bounds for quantum automata., , и . Theor. Comput. Sci., (2014)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)Guest Column: Quantum Finite Automata: From Theory to Practice., и . SIGACT News, 52 (3): 38-59 (2021)