A theory of ultimately periodic languages and automata with an application to time granularity
type: Item
instance of: scholarly article
title: A theory of ultimately periodic languages and automata with an application to time granularity
zbMATH Open document ID: 1186.68246
author: Davide Bresolin
author: Angelo Montanari
author: Gabriele Puppis
published in: Acta Informatica
publication date: 2009-10-02T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5610574
zbMATH Keywords: regular \(\omega \)-languages
MaRDI profile type: Publication
full work available at URL: s00236-009-0094-7
OpenAlex ID: W2146946740
cites work: Logics in Artificial Intelligence
cites work: Q4485446
cites work: LTL over integer periodicity constraints
cites work: Q4778773
cites work: An algebraic representation of calendars
cites work: Representing and Reasoning about Temporal Granularities
cites work: Q4385542
cites work: Theoretical Computer Science
cites work: Compact and tractable automaton-based representations of time granularities
cites work: Q5525343
cites work: Q4297397
cites work: A linear time solution to the single function coarsest partition problem
cites work: Fast Pattern Matching in Strings
cites work: Lexicographically least circular substrings
cites work: Fast canonization of circular strings
cites work: Q4506483
cites work: The complementation problem for Büchi automata with applications to temporal logic
cites work: Q4501665
cites work: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
cites work: Dynamic Consistency, Revelations in Auctions and the Structure of Preferences
cites work: Alternating finite automata on \(\omega\)-words
cites work: Q4536446
cites work: Q4298260
cites work: Minimal NFA Problems are Hard
cites work: On the State Minimization of Nondeterministic Finite Automata
DOI: 10.1007/S00236-009-0094-7
description: scientific article; zbMATH DE number 5610574