scientific article
From MaRDI portal
Publication:3792243
zbMath0647.68050MaRDI QIDQ3792243
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityregular languagescomplexity measuresprobabilistic automata\(\omega \)-languagenon-regular languagescomplexity gaps of Turing machines on finite wordsdeterministic filter \(\omega \)-automatoninfinite input words
This page was built for publication: