Decidability of the equivalence problem for deterministic pushdown automata
type: Item
instance of: scholarly article
title: Decidability of the equivalence problem for deterministic pushdown automata
zbMATH Open document ID: 0875.68644
DOI: 10.1007/BF01131845
author: V. Yu. Mejtus
published in: Cybernetics and Systems Analysis
publication date: 1997-01-20T00:00:00Z
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 949073
zbMATH Keywords: decidability
zbMATH Keywords: equivalence problem
zbMATH Keywords: deterministic pushdown automata
MaRDI profile type: Publication
cites work: Q5576254
cites work: Deterministic context free languages
cites work: On the translation of languages from left to right
cites work: Properties of deterministic top-down grammars
cites work: The equivalence problem for deterministic finite-turn pushdown automata
cites work: A result on the equivalence problem for deterministic pushdown automata
cites work: Deterministic one-counter automata
cites work: Equivalence problems for deterministic context-free languages and monadic recursion schemes
cites work: Program schemes, recursion schemes, and formal languages
description: scientific article; zbMATH DE number 949073