The equivalence problem for real-time DPDAs-Reference-Cited by-同舟云学术

The equivalence problem for real-time DPDAs

Published:1987-07 Issue:3 Volume:34 Page:731-760
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Oyamaguchi Michio¹

Affiliation:

1. Mie Univ., Tsu, Japan

Abstract

The equivalence problem for deterministic real-time pushdown automata is shown to be decidable. This result is obtained by showing that Valiant's parallel stacking technique using a replacement function introduced in this paper succeeds for deterministic real-time pushdown automata. Equivalence is also decidable for two deterministic pushdown automata, one of which is real-time.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/28869.28881

Reference29 articles.

1. An improvement on Valiant's decision procedure for equivalence of deterministic pushdown machines;BEERI C;Theoret. Comput. Sci.,1976

2. A representation of trees by languages;COURCELLE B;I. Theoret. Comput. Sci.,1978

3. A representation of trees by languages;COURCELLE;If. Theoret. Comput. Sci.,1978

4. The simultaneous accessibility of two configurations of two equivalent DPDAs;COURCELLE B;Inf. Proc. Lett.,1981

5. An axiomatic approach to the Korenjak-Hopcroft algorithms;COURCELLE B;Math. Syst. Theory,1983

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines;Automatic Control and Computer Sciences;2021-12

2. Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete;Mathematical Foundations of Computer Science 2011;2011

3. Equivalence of deterministic pushdown automata revisited;Cybernetics and Systems Analysis;2007-03

4. The Bisimulation Problem for Equational Graphs of Finite Out-Degree;SIAM Journal on Computing;2005-01

5. L(A)=L(B)? A simplified decidability proof;Theoretical Computer Science;2002-06