( en | de | ru )

 

Disambiguation of "Pardubská, Dana"

Author of the publication

copydeleteadd this publication to your clipboard
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.

, , and . LATA, volume 5457 of Lecture Notes in Computer Science, page 660-671. Springer, (2009)

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. You can also use the button next to the name to display some publications already assigned to the person.

Antonios K Danassis

Ataollah Danai

Ingeborg Danai

Michelle Danaher

Antonios K Danassis

 

Other publications of authors with the same name

Parallel Communicating Grammar Systems with Regular Control., , and . CAI, volume 5725 of Lecture Notes in Computer Science, page 342-360. Springer, (2009)Lexicalized Syntactic Analysis by Restarting Automata., , , and . Stringology, page 69-83. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2019)Randomization in Non-Uniform Finite Automata., , , , , and . MFCS, volume 170 of LIPIcs, page 30:1-30:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Two Lower Bounds on Distributive Generation of Languages., , , and . Fundam. Informaticae, 25 (3): 271-284 (1996)Analysis by Reduction, the Prague Dependency Treebank): Redukční Analýza a Pražský Závislostní Korpus., , and . ITAT, volume 1422 of CEUR Workshop Proceedings, page 43-50. CEUR-WS.org, (2015)One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars., , , and . ITAT, volume 3498 of CEUR Workshop Proceedings, page 110-120. CEUR-WS.org, (2023)On the complexity of reductions by restarting automata., , and . NCMA, volume 304 of books@ocg.at, page 207-222. Österreichische Computer Gesellschaft, (2014)Analysis by reduction of analytical PDT-trees., , and . NCMA, page 211-226. Österreichische Computer Gesellschaft, (2017)Wireless Parallel Computing and its Links to Descriptive Complexity., and . DCFS, page 41-56. University of Kosice, Slovakia, (2007)Factoring and testing primes in small space., and . RAIRO Theor. Informatics Appl., 47 (3): 241-259 (2013)