Deciding Determinism of Unary Languages Is coNP-Complete

DOI10.1007/978-3-642-38771-5_31zbMath1381.68127OpenAlexW91306599MaRDI QIDQ5300853

Feifei Peng, Ping Lu, Haiming Chen

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38771-5_31

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Deciding Determinism of Unary Languages Is coNP-Complete