A theory of ultimately periodic languages and automata with an application to time granularity
From MaRDI portal
Publication:731330
DOI10.1007/s00236-009-0094-7zbMath1186.68246OpenAlexW2146946740MaRDI QIDQ731330
Gabriele Puppis, Davide Bresolin, Angelo Montanari
Publication date: 2 October 2009
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-009-0094-7
Related Items (3)
From LP formulas of the form \(F(t)\) to \(-\omega \)-regular expressions ⋮ Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP ⋮ Deciding Monadic Second Order Logic over $$\omega $$ ω -Words by Specialized Finite Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Alternating finite automata on \(\omega\)-words
- Compact and tractable automaton-based representations of time granularities
- A linear time solution to the single function coarsest partition problem
- The complementation problem for Büchi automata with applications to temporal logic
- Lexicographically least circular substrings
- An algebraic representation of calendars
- LTL over integer periodicity constraints
- Dynamic Consistency, Revelations in Auctions and the Structure of Preferences
- Fast canonization of circular strings
- Fast Pattern Matching in Strings
- Minimal NFA Problems are Hard
- Representing and Reasoning about Temporal Granularities
- Logics in Artificial Intelligence
- On the State Minimization of Nondeterministic Finite Automata
- Theoretical Computer Science
This page was built for publication: A theory of ultimately periodic languages and automata with an application to time granularity
