Decomposing Timed Push Down Automata

Authors:
Padmanabhan Krishnan
Affiliations:
-
Venue:
Fundamenta Informaticae
Year:
2001

Citing 6
Cited 0

An introduction to automata theory

An introduction to automata theory
A theory of timed automata

Theoretical Computer Science
Algebraic Automata Theory

Algebraic Automata Theory
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A Determinizable Class of Timed Automata

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we define a particular type of timed push down automata. We show that the emptiness problem for this class is decidable. We also present a notion of homomorphism and parallel decomposition for these automata. These notions are a generalisation of the homomorphism and decomposition via partitions for finite automata.