Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words
type: Item
instance of: scholarly article
title: Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words
DOI: 10.1007/978-3-030-81508-0_15
author: Viktor Henriksson
author: Manfred Kufleitner
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7498725
MaRDI profile type: Publication
full work available at URL: 978-3-030-81508-0 15
OpenAlex ID: W3196841993
cites work: Unambiguous Büchi automata.
cites work: Finite-automaton aperiodicity is PSPACE-complete
cites work: On the expressive power of temporal logic
cites work: A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
cites work: Fragments of first-order logic over infinite words
cites work: Q4132170
cites work: The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
cites work: Languages of dot-depth 3/2
cites work: Q3113701
cites work: Q4988163
cites work: An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic
cites work: Level two of the quantifier alternation hierarchy over infinite words
cites work: Q4649563
cites work: Q5317419
cites work: Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
cites work: Sur le produit de concatenation non ambigu
cites work: Characterizations of some classes of regular events
cites work: Complexity of some problems from the theory of automata
cites work: Varieties
cites work: Q4542541
cites work: Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
description: scientific article; zbMATH DE number 7498725