Synchronizing Automata over Nested Words
From MaRDI portal
Publication:5208371
DOI10.25596/jalc-2019-219zbMath1429.68104OpenAlexW4288232262MaRDI QIDQ5208371
Dmitry Chistnikov, Mahsa Shirmohammadi, Pavel Martyugin
Publication date: 15 January 2020
Full work available at URL: https://hal.archives-ouvertes.fr/hal-02411524
decision problemsnested wordsvisibly pushdown automataformal language theoryStrahler numbersynchronizing words
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Synchronization of Parikh automata ⋮ Synchronizing deterministic push-down automata can be really hard
This page was built for publication: Synchronizing Automata over Nested Words