Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
type: Item
instance of: scholarly article
title: Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
zbMATH Open document ID: 1433.68192
author: David Barozzini
author: Dario Della Monica
author: Angelo Montanari
author: Pietro Sala
author: David de Frutos Escrig
published in: Theoretical Computer Science
publication date: 2020-04-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 7191319
zbMATH Keywords: \(\omega \)-regular languages
zbMATH Keywords: \(\omega \)-regular expressions
zbMATH Keywords: counter automata
zbMATH Keywords: monadic second-order logic of one successor
MaRDI profile type: Publication
full work available at URL: j.tcs.2019.12.029
OpenAlex ID: W2998521476
cites work: Q3384174
cites work: Q5525343
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
cites work: Q4385530
cites work: Weak MSO with the unbounding quantifier
cites work: Q4596779
cites work: Deterministic automata and extensions of weak MSO
cites work: From liveness to promptness
cites work: Prompt Interval Temporal Logic
cites work: Computer Science Logic
cites work: Q4601873
cites work: MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
cites work: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
cites work: The topological complexity of MSO+U and related automata models
cites work: Separation Property for wB- and wS-regular Languages
cites work: Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
cites work: Interval Logics and ωB-Regular Languages
DOI: 10.1016/J.TCS.2019.12.029
description: scientific article; zbMATH DE number 7191319