ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA.

Kenichi Taniguchi, Tadao Kasami, Yugi Sugiyama

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

L. G. Valiant has shown that for a subclass N//0 of empty-stack accepting DPDA without epsilon -operation, the equivalence can be decided between automata in N//0. The class of languages accepted by automata in this N//0 properly contains the class of LL(k) languages. Harrison and others have shown that the equivalence can be decided between an empty-stack accepting DPDA with general epsilon -operation (this class is referred to as D//0) and a simple deterministic language. This paper extends these results so that both the above results are integrated and shows that the equivalence can be decided between a DPDA in D//0 and a DPDA in N//0.

Original languageEnglish
Title of host publicationSyst Comput Controls
Pages36-44
Number of pages9
Volume6
Edition1
Publication statusPublished - Jan 1975
Externally publishedYes

Fingerprint

Computability and decidability

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Taniguchi, K., Kasami, T., & Sugiyama, Y. (1975). ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA. In Syst Comput Controls (1 ed., Vol. 6, pp. 36-44)

ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA. / Taniguchi, Kenichi; Kasami, Tadao; Sugiyama, Yugi.

Syst Comput Controls. Vol. 6 1. ed. 1975. p. 36-44.

Research output: Chapter in Book/Report/Conference proceedingChapter

Taniguchi, K, Kasami, T & Sugiyama, Y 1975, ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA. in Syst Comput Controls. 1 edn, vol. 6, pp. 36-44.
Taniguchi K, Kasami T, Sugiyama Y. ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA. In Syst Comput Controls. 1 ed. Vol. 6. 1975. p. 36-44
Taniguchi, Kenichi ; Kasami, Tadao ; Sugiyama, Yugi. / ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA. Syst Comput Controls. Vol. 6 1. ed. 1975. pp. 36-44
@inbook{3a2b33a6880a480e96c42e89f5a66ccc,
title = "ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA.",
abstract = "L. G. Valiant has shown that for a subclass N//0 of empty-stack accepting DPDA without epsilon -operation, the equivalence can be decided between automata in N//0. The class of languages accepted by automata in this N//0 properly contains the class of LL(k) languages. Harrison and others have shown that the equivalence can be decided between an empty-stack accepting DPDA with general epsilon -operation (this class is referred to as D//0) and a simple deterministic language. This paper extends these results so that both the above results are integrated and shows that the equivalence can be decided between a DPDA in D//0 and a DPDA in N//0.",
author = "Kenichi Taniguchi and Tadao Kasami and Yugi Sugiyama",
year = "1975",
month = "1",
language = "English",
volume = "6",
pages = "36--44",
booktitle = "Syst Comput Controls",
edition = "1",

}

TY - CHAP

T1 - ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA.

AU - Taniguchi, Kenichi

AU - Kasami, Tadao

AU - Sugiyama, Yugi

PY - 1975/1

Y1 - 1975/1

N2 - L. G. Valiant has shown that for a subclass N//0 of empty-stack accepting DPDA without epsilon -operation, the equivalence can be decided between automata in N//0. The class of languages accepted by automata in this N//0 properly contains the class of LL(k) languages. Harrison and others have shown that the equivalence can be decided between an empty-stack accepting DPDA with general epsilon -operation (this class is referred to as D//0) and a simple deterministic language. This paper extends these results so that both the above results are integrated and shows that the equivalence can be decided between a DPDA in D//0 and a DPDA in N//0.

AB - L. G. Valiant has shown that for a subclass N//0 of empty-stack accepting DPDA without epsilon -operation, the equivalence can be decided between automata in N//0. The class of languages accepted by automata in this N//0 properly contains the class of LL(k) languages. Harrison and others have shown that the equivalence can be decided between an empty-stack accepting DPDA with general epsilon -operation (this class is referred to as D//0) and a simple deterministic language. This paper extends these results so that both the above results are integrated and shows that the equivalence can be decided between a DPDA in D//0 and a DPDA in N//0.

UR - http://www.scopus.com/inward/record.url?scp=0016419079&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0016419079&partnerID=8YFLogxK

M3 - Chapter

VL - 6

SP - 36

EP - 44

BT - Syst Comput Controls

ER -