Universality of Regular Realizability Problems

DOI10.1007/978-3-642-38536-0_24zbMath1381.68137OpenAlexW202271525MaRDI QIDQ4928492

Mikhail N. Vyalyi

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_24

Mathematics Subject Classification ID

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

Related Items (1)

Regular Realizability Problems and Context-Free Languages

This page was built for publication: Universality of Regular Realizability Problems