scientific article; zbMATH DE number 2087227
From MaRDI portal
Publication:4737911
zbMath1073.68051MaRDI QIDQ4737911
Heribert Vollmer, Thomas Schwentick, Denis Thérien
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2295/22950239.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The word problem for omega-terms over the Trotter-Weil hierarchy ⋮ On FO 2 Quantifier Alternation over Words ⋮ The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy ⋮ Unnamed Item ⋮ State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs ⋮ Conelikes and ranker comparisons ⋮ Unnamed Item ⋮ Simon's congruence pattern matching ⋮ On shuffle products, acyclic automata and piecewise-testable languages ⋮ Circuit complexity of regular languages ⋮ First-order rewritability of ontology-mediated queries in linear temporal logic ⋮ Circuit complexity of regular languages ⋮ The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ On Simon's congruence closure of a string ⋮ Partially Ordered Two-Way Büchi Automata ⋮ On Simon's congruence closure of a string ⋮ State complexity of permutation and related decision problems on alphabetical pattern constraints
