A theory of ultimately periodic languages and automata with an application to time granularity

DOI10.1007/S00236-009-0094-7MaRDI QIDQ731330zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

regular \(\omega \)-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Logics in Artificial Intelligence
• scientific article; zbMATH DE number 1832332
• Ultimately periodic words of rational ω-languages
• Towards compact and tractable automaton-based representations of time granularities.
• Compact and tractable automaton-based representations of time granularities

Cites work

• scientific article; zbMATH DE number 599132 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 1458810 (Why is no real title available?)
• scientific article; zbMATH DE number 1500643 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1759492 (Why is no real title available?)
• scientific article; zbMATH DE number 1832332 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• A linear time solution to the single function coarsest partition problem
• Alternating finite automata on -words
• An algebraic representation of calendars
• Compact and tractable automaton-based representations of time granularities
• Dynamic Consistency, Revelations in Auctions and the Structure of Preferences
• Fast Pattern Matching in Strings
• Fast canonization of circular strings
• LTL over integer periodicity constraints
• Lexicographically least circular substrings
• Logics in Artificial Intelligence
• Minimal NFA Problems are Hard
• On the State Minimization of Nondeterministic Finite Automata
• Representing and Reasoning about Temporal Granularities
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• The complementation problem for Büchi automata with applications to temporal logic
• Towards compact and tractable automaton-based representations of time granularities.

Cited in

(6)

• From LP formulas of the form F(t) to - -regular expressions
• Deciding monadic second order logic over \(\omega \)-words by specialized finite automata
• scientific article; zbMATH DE number 739127 (Why is no real title available?)
• Detecting fictitious states in a -automaton synthesized from its specification in the language LP
• scientific article; zbMATH DE number 1956642 (Why is no real title available?)
• 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)