Preview
Unable to display preview. Download preview PDF.
References
Perrin D. Recent results on automata and infinite words//Lect.Notes in Comp.Sci.-1984.-vol.176, MFCS-84.-p.134–148.
Freivalds R. Minimalnoje chislo zadavajemih voprosov v derevjah reshenij//Teor. voprosi programmirovanija.-Riga, LU, 1988.-p.81–83. (Russian)
Alberts M. Bulevi funkciji na beskonechnih slovah//Teor. voprosi programmirovanija.-Riga, LU, 1988.-p.23–32. (Russian)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alberts, M. (1990). Interrogative complexity of ω-languages’ recognition. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029602
Download citation
DOI: https://doi.org/10.1007/BFb0029602
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52953-8
Online ISBN: 978-3-540-47185-1
eBook Packages: Springer Book Archive