scientific article; zbMATH DE number 408810

zbMath0783.03025MaRDI QIDQ4202955

Sebastian Seibert

Publication date: 6 September 1993

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

zbMATH Keywords

finite automatapushdown automataarithmetical hierarchies defined by finite word relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Word problems, etc. in computability and recursion theory (03D40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)

Related Items (3)

On Boolean closed full trios and rational Kripke frames ⋮ The expressibility of languages and relations by word equations ⋮ The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata

This page was built for publication: