On the determinization of event-clock input-driven pushdown automata
From MaRDI portal
Publication:2097230
Cites work
- A logical characterization for dense-time visibly pushdown automata
- A theory of timed automata
- Adding nesting structure to words
- Dense-timed pushdown automata
- Descriptional complexity of input-driven pushdown automata
- Event-clock automata: a determinizable class of timed automata
- Event-clock nested automata
- Event-Clock Visibly Pushdown Automata
- Formal Methods for the Design of Real-Time Systems
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 3885334 (Why is no real title available?)
- scientific article; zbMATH DE number 3696500 (Why is no real title available?)
- Input-driven pushdown automata on well-nested infinite strings
- Input-Driven Pushdown Automata with Limited Nondeterminism
- On regions and zones for event-clock automata
- Timed Pushdown Automata Revisited
- Visibly pushdown languages
Cited in
(7)- Event-clock automata: a determinizable class of timed automata
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Input-Driven Pushdown Automata with Limited Nondeterminism
- Event-Clock Visibly Pushdown Automata
- scientific article; zbMATH DE number 1390065 (Why is no real title available?)
- Exact descriptional complexity of determinization of input-driven pushdown automata
- Probabilistic input-driven pushdown automata
This page was built for publication: On the determinization of event-clock input-driven pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097230)
