| No. | Title | Author | Year |
|---|---|---|---|
| 1 | The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets | Jančar, Petr et al. | 2023 |
| 2 | The Simplest Non-Regular Deterministic Context-Free Language | Jančar, Petr et al. | 2021 |
| 3 | Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence | Jancar, Petr | 2016 |
| 4 | Bisimilarity of Probabilistic Pushdown Automata | Forejt, Vojtech et al. | 2012 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 4 |