Dana Pardubská

According to our database1, Dana Pardubská authored at least 39 papers between 1989 and 2023.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars.
Proceedings of the 23rd Conference Information Technologies, 2023

On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars.
Proceedings of the 22nd Conference Information Technologies, 2022

Lexicalized Syntactic Analysis by Two-Way Restarting Automata.
J. Autom. Lang. Comb., 2021

On Separations of LR(0)-Grammars by Two Types of Pumping Patterns.
Proceedings of the 21st Conference Information Technologies, 2021

Tight hierarchy of data-independent multi-head automata.
J. Comput. Syst. Sci., 2020

Exploration of Time-Varying Connected Graphs with Silent Agents.
Proceedings of the Structural Information and Communication Complexity, 2020

Improved Lower Bounds for Shoreline Search.
Proceedings of the Structural Information and Communication Complexity, 2020

Randomization in Non-Uniform Finite Automata.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Pumping Deterministic Monotone Restarting Automata and DCFL.
Proceedings of the 20th Conference Information Technologies, 2020

Lexicalized Syntactic Analysis by Restarting Automata.
Proceedings of the Prague Stringology Conference 2019, 2019

Lexically Syntactic Characterization by Restarting Automata.
Proceedings of the 19th Conference Information Technologies, 2019

Robustness versus Sensibility by Two-Way Restarting Automata.
Proceedings of the 18th Conference Information Technologies, 2018

Isometric gene tree reconciliation revisited.
Algorithms Mol. Biol., 2017

Treasure Hunt with Barely Communicating Agents.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Analysis by reduction of analytical PDT-trees.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

Analysis by Reduction, the Prague Dependency Treebank): Redukční Analýza a Pražský Závislostní Korpus.
Proceedings of the Proceedings ITAT 2015: Information Technologies, 2015

On the complexity of reductions by restarting automata.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

On Minimalism of Analysis by Reduction by Restarting Automata.
Proceedings of the Formal Grammar - 19th International Conference, 2014

Factoring and testing primes in small space.
RAIRO Theor. Informatics Appl., 2013

Unary Coded NP-Complete Languages in Aspace(log log n).
Int. J. Found. Comput. Sci., 2013

Parallel communicating grammar systems with regular control and skeleton preserving FRR automata.
Theor. Comput. Sci., 2011

Translations by Regulated Parallel Communicating Grammar Systems.
J. Autom. Lang. Comb., 2011

Measuring the problem-relevant information in input.
RAIRO Theor. Informatics Appl., 2009

Antibandwidth and Cyclic Antibandwidth of Hamming Graphs.
Electron. Notes Discret. Math., 2009

Black Hole Search in Directed Graphs.
Proceedings of the Structural Information and Communication Complexity, 2009

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.
Proceedings of the Language and Automata Theory and Applications, 2009

Parallel Communicating Grammar Systems with Regular Control.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

Wireless Mobile Computing and its Links to Descriptive Complexity.
Int. J. Found. Comput. Sci., 2008

How Much Information about the Future Is Needed?
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Leader Election in Extremely Unreliable Rings and Complete Networks.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

On PCGS and FRR-automata.
Proceedings of the Conference on Theory and Practice of Information Technologies, 2008


Wireless Parallel Computing and its Links to Descriptive Complexity.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

Effective Systolic Algorithms for Gossiping in Cycles.
Parallel Process. Lett., 1998

Two Lower Bounds on Distributive Generation of Languages.
Fundam. Informaticae, 1996

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

The Complexity of Systolic Dissemination of Information in Interconnection Networks.
RAIRO Theor. Informatics Appl., 1994

On the Power of Communication Structure for Distributive Generation of Languages.
Proceedings of the Developments in Language Theory, 1993

Nondeterministic Multicounter Machines and Complementation.
Theor. Comput. Sci., 1989