Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy

DOI10.1007/11779148_37zbMath1227.68028OpenAlexW1544313815MaRDI QIDQ3617079

Christian Glaßer, Stephen Travers, Klaus W. Wagner

Publication date: 26 March 2009

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

Full work available at URL: https://doi.org/10.1007/11779148_37

Mathematics Subject Classification ID

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

This page was built for publication: Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy