The Join Levels of the Trotter-Weil Hierarchy Are Decidable

DOI10.1007/978-3-642-32589-2_53zbMath1365.68335arXiv1204.4672OpenAlexW1728819265MaRDI QIDQ2912759

Manfred Kufleitner, Alexander Lauser

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.4672

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Related Items (6)

The word problem for omega-terms over the Trotter-Weil hierarchy ⋮ The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy ⋮ Conelikes and ranker comparisons ⋮ How many times do you need to go back to the future in unary temporal logic? ⋮ The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy ⋮ One quantifier alternation in first-order logic with modular predicates

This page was built for publication: The Join Levels of the Trotter-Weil Hierarchy Are Decidable