Circuit Complexity of Regular Languages

DOI10.1007/978-3-540-73001-9_44zbMath1151.68461OpenAlexW2152412744MaRDI QIDQ5425344

Michal Koucký

Publication date: 13 November 2007

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-73001-9_44

zbMATH Keywords

circuit complexityregular languages

Mathematics Subject Classification ID

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

This page was built for publication: Circuit Complexity of Regular Languages