scientific article

zbMath0658.68098MaRDI QIDQ3806849

Wolfgang Thomas, Denis Thérien, Howard Straubing

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

first-order logicregular languagessyntactic monoids\(\omega\)- languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Classical first-order logic (03B10)

Related Items (18)

Modulo-counting quantifiers over finite trees ⋮ First-order logic and its infinitary quantifier extensions over countable words ⋮ A note on some languages in uniform \(ACC^ 0\) ⋮ On uniformity within \(NC^ 1\) ⋮ Extensions of an idea of McNaughton ⋮ Unnamed Item ⋮ Sur le produit avec compteur modulo un nombre premier ⋮ Products of languages with counter ⋮ Languages and scanners ⋮ Logically defined subsets of \(\mathbb{N}{}^ k\) ⋮ Monadic partition logics and finite automata ⋮ Regular languages in \(NC\) ⋮ Formulas, regular languages and Boolean circuits ⋮ Closure of varieties of languages under products with counter ⋮ Circuit complexity and the expressive power of generalized first-order formulas ⋮ Mathematical logic and quantum finite state automata ⋮ Logic, semigroups and automata on words ⋮ The many faces of a translation

This page was built for publication: