scientific article

zbMath0479.68075MaRDI QIDQ3938520

Ludwig Staiger

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite syntactic monoidlevels of the Borel hierarchyomega languages accepted by finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)

Related Items

On?-Languages whose syntactic monoid is trivial ⋮ Locally finite languages