scientific article; zbMATH DE number 459361
From MaRDI portal
Publication:4271219
zbMATH Open0799.20064MaRDI QIDQ4271219
Publication date: 21 November 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitymonadic second-order logicfinite automataformal languagesregular languagesfirst-order definabilityrecognizability
Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (8)
Complexity of some problems from the theory of automata ⋮ Automata and logics over finitely varying functions ⋮ Unnamed Item ⋮ Automata and finite model theory ⋮ Automata vs. Logics on Data Words ⋮ Logic and Branching Automata ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: