Pages that link to "Item:Q728264"
From MaRDI portal
The following pages link to A logical characterization of timed regular languages (Q728264):
Displaying 13 items.
- A tool for deciding the satisfiability of continuous-time metric temporal logic (Q262137) (← links)
- Using formal verification to evaluate the execution time of Spark applications (Q782497) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- LOGSPACE and PTIME characterized by programming languages (Q1575880) (← links)
- On the initialization of clocks in timed formalisms (Q1989329) (← links)
- Two size measures for timed languages (Q2908867) (← links)
- Generating Functions of Timed Languages (Q2912714) (← links)
- A Machine-Independent Characterization of Timed Languages (Q3167002) (← links)
- Unambiguity in Timed Regular Languages: Automata and Logics (Q3588092) (← links)
- (Q4791839) (← links)
- Foundations of Software Science and Computation Structures (Q5308461) (← links)
- Developments in Language Theory (Q5473678) (← links)
- Active learning of deterministic timed automata with Myhill-Nerode style characterization (Q6535622) (← links)