Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata

DOI10.2168/LMCS-9(2:8)2013zbMath1272.03094arXiv1303.5956OpenAlexW2088503271MaRDI QIDQ5299843

Preugschat Sebastian, Thomas Wilke

Publication date: 24 June 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

temporal operatorsunambiguous Büchi automataforbidden patterns in automatafragments of temporal logic

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)

Related Items

Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words, Forbidden Patterns for FO² Alternation Over Finite and Infinite Words, \( \omega \)-automata, Backward Deterministic Büchi Automata on Infinite Words