An algebraic approach to data languages and timed languages
From MaRDI portal
Publication:1398367
DOI10.1016/S0890-5401(03)00038-5zbMath1028.68080MaRDI QIDQ1398367
Antoine Petit, Patricia Bouyer, Denis Thérien
Publication date: 29 July 2003
Published in: Information and Computation (Search for Journal in Brave)
Related Items (9)
On notions of regularity for data languages ⋮ Future-Looking Logics on Data Words and Trees ⋮ On the freeze quantifier in Constraint LTL: Decidability and complexity ⋮ Nominal monoids ⋮ Automata for XML -- a survey ⋮ A study on shuffle, stopwatches and independently evolving clocks ⋮ Relating timed and register automata ⋮ A Note on C² Interpreted over Finite Data-Words ⋮ Model checking memoryful linear-time logics over one-counter automata
Cites Work
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Langages sur des alphabets infinis
- A theory of timed automata
- Finite-memory automata
- A logical characterization of data languages.
- Timed regular expressions
- The expressive power of clocks
- On finite monoids having only trivial subgroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An algebraic approach to data languages and timed languages
