A Machine-Independent Characterization of Timed Languages
From MaRDI portal
Recommendations
- A logical characterization of timed (non-)regular languages
- A logical characterization of timed regular languages
- A logical characterization of timed pushdown languages
- Foundations of Software Science and Computation Structures
- A perfect class of context-sensitive timed languages
- Developments in Language Theory
- Formal Modeling and Analysis of Timed Systems
- A nonarchimedian discretization for timed languages
- scientific article; zbMATH DE number 2182596
- scientific article; zbMATH DE number 1863168
Cited in
(15)- Reachability relations of timed pushdown automata
- Two size measures for timed languages
- Generating Functions of Timed Languages
- Relating timed and register automata
- Untimed Language Preservation in Timed Systems
- scientific article; zbMATH DE number 1956642 (Why is no real title available?)
- scientific article; zbMATH DE number 1863168 (Why is no real title available?)
- scientific article; zbMATH DE number 7559498 (Why is no real title available?)
- Determinisability of register and timed automata
- Foundations of Software Science and Computation Structures
- Developments in Language Theory
- Fast computations on ordered nominal sets
- Active learning of deterministic timed automata with Myhill-Nerode style characterization
- Reachability for updatable timed automata made faster and more effective
- A Myhill-Nerode style characterization for timed automata with integer resets
This page was built for publication: A Machine-Independent Characterization of Timed Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167002)
