scientific article; zbMATH DE number 1775408

zbMath1027.68614MaRDI QIDQ4542541

Thomas Wilke, Denis Thérien

Publication date: 17 September 2002

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

zbMATH Keywords

first-order logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (28)

Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words ⋮ Regular languages of thin trees ⋮ The word problem for omega-terms over the Trotter-Weil hierarchy ⋮ The complexity of intersecting finite automata having few final states ⋮ The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy ⋮ Linear circuits, two-variable logic and weakly blocked monoids ⋮ Alternation Hierarchies of First Order Logic with Regular Predicates ⋮ Unnamed Item ⋮ Locality and Centrality: The Variety ZG ⋮ Conelikes and ranker comparisons ⋮ How many times do you need to go back to the future in unary temporal logic? ⋮ Forbidden Patterns for FO² Alternation Over Finite and Infinite Words ⋮ A Trichotomy for Regular Trail Queries ⋮ Characterization of Logics over Ranked Tree Languages ⋮ Separating Without Any Ambiguity. ⋮ Fragments of first-order logic over infinite words ⋮ The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy ⋮ On the lattice of sub-pseudovarieties of DA. ⋮ Unnamed Item ⋮ Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] ⋮ Partially Ordered Two-Way Büchi Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Linear Completeness Thresholds for Bounded Model Checking ⋮ Separating regular languages with two quantifier alternations ⋮ Unnamed Item ⋮ Varieties ⋮ One quantifier alternation in first-order logic with modular predicates

This page was built for publication: