Languages defined with modular counting quantifiers. (Extended abstract)

DOI10.1007/BFB0028572MaRDI QIDQ4381392zbMATH OpenFDO

Authors Howard Straubing

Publication date 8 October 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028572

zbMATH Keywords

circuit complexitymodular counting quantifiersregular language

Mathematics Subject Classification ID

Logic with extra quantifiers and operators (03C80) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Formal languages and automata (68Q45)

Recommendations

• Languages defined with modular counting quantifiers
• Definability of Languages by Generalized First-Order Formulas over (N,+)
• Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
• Regular languages defined with generalized quantifiers
• Modular quantifiers

Cited in

(9)

• On languages in countably generated semilattices
• Programs over semigroups of dot-depth one
• Counting modulo quantifiers on finite structures
• Languages defined with modular counting quantifiers
• Modular quantifiers
• scientific article; zbMATH DE number 4076666 (Why is no real title available?)
• Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
• Definability of Languages by Generalized First-Order Formulas over (N,+)
• Trace languages definable with modular quantifiers

This page was built for publication: Languages defined with modular counting quantifiers. (Extended abstract)

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