Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Petr Jančar
Equivalences of Pushdown Systems Are Hard
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Asynchronously Communicating Visibly Pushdown Systems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Reachability Analysis of Communicating Pushdown Systems
Logical Methods in Computer Science
Computer Science
Theoretical Computer Science
Equivalences of C*-Dynamical Systems
Banach Center Publications
Higher-Order Pushdown Trees Are Easy
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Controllers for the Verification of Communicating Multi-Pushdown Systems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems
Packing LPs Are Hard to Solve Accurately, Assuming Linear Equations Are Hard
Deciding Probabilistic Simulation Between Probabilistic Pushdown Automata and Finite-State Systems
Information and Computation
Theoretical Computer Science
Computational Theory
Computer Science Applications
Information Systems
Mathematics
