scientific article; zbMATH DE number 4204325

MaRDI QIDQ3353005zbMATH OpenFDO

Authors Pierre Péladeau

Publication date 1989

zbMATH Keywords

rational subsetsrational languagerecognizable subsetssemi-simple setsparallel complexity class \(ACC^ 0\)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic with extra quantifiers and operators (03C80) Automata and formal grammars in connection with logical questions (03D05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• scientific article; zbMATH DE number 622016
• Counting modulo quantifiers on finite structures
• Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
• Definability of Languages by Generalized First-Order Formulas over (N,+)
• scientific article; zbMATH DE number 3993564

Cited in

(4)

• Logically defined subsets of \(\mathbb{N}{}^ k\)
• scientific article; zbMATH DE number 622016 (Why is no real title available?)
• A note on some languages in uniform \(ACC^ 0\)
• scientific article; zbMATH DE number 4033719 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3353005)