An algebraic approach to data languages and timed languages
From MaRDI portal
Publication:1398367
Recommendations
Cites work
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 1530301 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1834677 (Why is no real title available?)
- scientific article; zbMATH DE number 1863168 (Why is no real title available?)
- scientific article; zbMATH DE number 1916671 (Why is no real title available?)
- scientific article; zbMATH DE number 1405646 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A logical characterization of data languages.
- A theory of timed automata
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Finite-memory automata
- Langages sur des alphabets infinis
- On finite monoids having only trivial subgroups
- The expressive power of clocks
- Timed regular expressions
Cited in
(12)- On timed regular languages defined by inverse monoid morphisms
- Model checking memoryful linear-time logics over one-counter automata
- Nominal monoids
- 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
- On notions of regularity for data languages
- A study on shuffle, stopwatches and independently evolving clocks
- scientific article; zbMATH DE number 1863168 (Why is no real title available?)
- Relating timed and register automata
- Mathematical Foundations of Computer Science 2004
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)
