论文信息 - Decomposing Timed Push Down Automata

Decomposing Timed Push Down Automata

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.

Padmanabhan Krishnan | P. Krishnan

[1] M. W. Shields. An Introduction to Automata Theory , 1988 .

[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[3] J. Hartmanis. Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics) , 1966 .

[4] J. Hartmanis,et al. Algebraic Structure Theory Of Sequential Machines , 1966 .

[5] W. Holcombe. Algebraic automata theory: Contents , 1982 .

[6] Tadashi Ae. Direct or Cascade Product of Pushdown Automata , 1977, J. Comput. Syst. Sci..

[7] Thomas A. Henzinger,et al. A Determinizable Class of Timed Automata , 1994, CAV.

[8] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..