A theory of ultimately periodic languages and automata with an application to time granularity
From MaRDI portal
Publication:731330
DOI10.1007/S00236-009-0094-7zbMATH Open1186.68246OpenAlexW2146946740MaRDI QIDQ731330FDOQ731330
Authors: Davide Bresolin, Angelo Montanari, Gabriele Puppis 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Pattern Matching in Strings
- Minimal NFA Problems are Hard
- Alternating finite automata on \(\omega\)-words
- Title not available (Why is that?)
- The complementation problem for Büchi automata with applications to temporal logic
- Lexicographically least circular substrings
- Fast canonization of circular strings
- On the State Minimization of Nondeterministic Finite Automata
- Dynamic Consistency, Revelations in Auctions and the Structure of Preferences
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- A linear time solution to the single function coarsest partition problem
- An algebraic representation of calendars
- LTL over integer periodicity constraints
- Representing and Reasoning about Temporal Granularities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logics in Artificial Intelligence
- Towards compact and tractable automaton-based representations of time granularities.
- Compact and tractable automaton-based representations of time granularities
Cited In (6)
- From LP formulas of the form \(F(t)\) to \(-\omega \)-regular expressions
- Deciding monadic second order logic over \(\omega \)-words by specialized finite automata
- Title not available (Why is that?)
- Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP
- Title not available (Why is that?)
- Logics in Artificial Intelligence
This page was built for publication: A theory of ultimately periodic languages and automata with an application to time granularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731330)
