Adding Time to Pushdown Automata
Logic in Computer Science
2012-12-18 v1 Formal Languages and Automata Theory
Abstract
In this tutorial, we illustrate through examples how we can combine two classical models, namely those of pushdown automata (PDA) and timed automata, in order to obtain timed pushdown automata (TPDA). Furthermore, we describe how the reachability problem for TPDAs can be reduced to the reachability problem for PDAs.
Keywords
Cite
@article{arxiv.1212.3871,
title = {Adding Time to Pushdown Automata},
author = {Parosh Aziz Abdulla and Mohamed Faouzi Atig and Jari Stenman},
journal= {arXiv preprint arXiv:1212.3871},
year = {2012}
}
Comments
In Proceedings QFM 2012, arXiv:1212.3454