Decomposing timed push down automata

Authors
Krishnan, P
Citation
P. Krishnan, Decomposing timed push down automata, FUNDAM INF, 45(3), 2001, pp. 215-229
Citations number
8
Categorie Soggetti
Computer Science & Engineering
Journal title
FUNDAMENTA INFORMATICAE
ISSN journal
01692968 → ACNP
Volume
45
Issue
3
Year of publication
2001
Pages
215 - 229
Database
ISI
SICI code
0169-2968(200102)45:3<215:DTPDA>2.0.ZU;2-P
Abstract
In this paper we define a particular type of timed push down automata. We s how that the emptiness problem for this class is decidable. We also present a notion of homomorphism and parallel decomposition for these automata. Th ese notions are a generalisation of the homomorphism and decomposition via partitions for finite automata.