A Simple P-Complete Problem and Its Representations by Language Equations

DOI10.1007/978-3-540-74593-8_23zbMath1211.68237OpenAlexW1524308938MaRDI QIDQ3608489

Alexander Okhotin

Publication date: 5 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74593-8_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: A Simple P-Complete Problem and Its Representations by Language Equations