Advertisement

Interrogative complexity of ω-languages’ recognition

  • Māris Alberts
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Perrin D. Recent results on automata and infinite words//Lect.Notes in Comp.Sci.-1984.-vol.176, MFCS-84.-p.134–148.Google Scholar
  2. 2.
    Freivalds R. Minimalnoje chislo zadavajemih voprosov v derevjah reshenij//Teor. voprosi programmirovanija.-Riga, LU, 1988.-p.81–83. (Russian)Google Scholar
  3. 3.
    Alberts M. Bulevi funkciji na beskonechnih slovah//Teor. voprosi programmirovanija.-Riga, LU, 1988.-p.23–32. (Russian)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Māris Alberts
    • 1
  1. 1.Research Institute of Mathematics and Computer ScienceLatvia UniversityRigaLatvia

Personalised recommendations