ON UNIVERSALLY POLYNOMIAL CONTEXT-FREE LANGUAGES

DOI10.1142/S0129054102001485zbMath1067.68088OpenAlexW1993262848MaRDI QIDQ3021989

Nicholas Q. Tran

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001485

zbMATH Keywords

context-free languageNP-completeuniversally polynomial

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• On Isomorphisms and Density of $NP$ and Other Complete Sets

This page was built for publication: ON UNIVERSALLY POLYNOMIAL CONTEXT-FREE LANGUAGES