The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems
From MaRDI portal
Publication:3457800
DOI10.1007/978-3-319-11936-6_19zbMath1448.68270OpenAlexW140546130MaRDI QIDQ3457800
Vincent Penelle, Jérôme Leroux, Grégoire Sutre
Publication date: 17 December 2015
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11936-6_19
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Context-Freeness of Word-MIX Languages ⋮ On decidability and complexity of low-dimensional robot games
This page was built for publication: The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems
