scientific article; zbMATH DE number 4204325

zbMATH Open0729.03020MaRDI QIDQ3353005FDOQ3353005

Pierre Péladeau

Publication date: 1989

Title of this publication is not available (Why is that?)

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)

Cited In (3)

• Logically defined subsets of \(\mathbb{N}{}^ k\)
• Title not available (Why is that?)
• A note on some languages in uniform \(ACC^ 0\)

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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,+) 👍 👎
• Title not available (Why is that?) 👍 👎

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)