Computing Downward Closures for Stacked Counter Automata
From MaRDI portal
Publication:2955038
DOI10.4230/LIPIcs.STACS.2015.743zbMath1355.68171arXiv1409.7922OpenAlexW2964055444MaRDI QIDQ2955038
Publication date: 24 January 2017
Full work available at URL: https://arxiv.org/abs/1409.7922
Related Items (7)
An Approach to Computing Downward Closures ⋮ The emptiness problem for valence automata over graph monoids ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Existential Definability over the Subword Ordering ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Unnamed Item
This page was built for publication: Computing Downward Closures for Stacked Counter Automata