An algebraic approach to data languages and timed languages
From MaRDI portal
Publication:1398367
DOI10.1016/S0890-5401(03)00038-5zbMATH Open1028.68080MaRDI QIDQ1398367FDOQ1398367
Authors: Patricia Bouyer, A. Petit, Denis Thérien 
Publication date: 29 July 2003
Published in: Information and Computation (Search for Journal in Brave)
Recommendations
Cites Work
- A theory of timed automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Finite-memory automata
- Title not available (Why is that?)
- Timed regular expressions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A logical characterization of data languages.
- Title not available (Why is that?)
- Langages sur des alphabets infinis
- The expressive power of clocks
- Title not available (Why is that?)
Cited In (12)
- Model checking memoryful linear-time logics over one-counter automata
- Automata for XML -- a survey
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- A Note on C² Interpreted over Finite Data-Words
- Future-Looking Logics on Data Words and Trees
- A study on shuffle, stopwatches and independently evolving clocks
- On notions of regularity for data languages
- Relating timed and register automata
- Nominal monoids
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2004
- On timed regular languages defined by inverse monoid morphisms
This page was built for publication: An algebraic approach to data languages and timed languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398367)
