scientific article; zbMATH DE number 6109849

DOI10.4230/LIPIcs.CSL.2012.426zbMath1252.03021arXiv1203.6152MaRDI QIDQ4649563

Manfred Kufleitner, Pascal Weil

Publication date: 22 November 2012

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

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

zbMATH Keywords

automata theorysemigroupfirst-order logicregular languagecondensed ranker

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (8)

Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words ⋮ The word problem for omega-terms over the Trotter-Weil hierarchy ⋮ The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy ⋮ Alternation Hierarchies of First Order Logic with Regular Predicates ⋮ 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 ⋮ The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy

This page was built for publication: