Definability of Languages by Generalized First-Order Formulas over (N,+)

DOI10.1007/11672142_40zbMath1136.03321OpenAlexW1481876218MaRDI QIDQ5449824

Amitabha Roy, Howard Straubing

Publication date: 19 March 2008

Published in: STACS 2006 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35) Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

An Ehrenfeucht-Fraïssé game approach to collapse results in database theory

This page was built for publication: Definability of Languages by Generalized First-Order Formulas over (N,+)