DPDA's in 'Atomic normal form' and applications to equivalence problems
type: Item
instance of: scholarly article
title: DPDA's in 'Atomic normal form' and applications to equivalence problems
zbMATH Open document ID: 0474.68065
DOI: 10.1016/0304-3975(81)90055-4
author: Jean Gallier
published in: Theoretical Computer Science
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3744552
zbMATH Keywords: address language
zbMATH Keywords: recursion schemes
zbMATH Keywords: deterministic pushdown automata
zbMATH Keywords: encoding of trees
MaRDI profile type: Publication
full work available at URL: 0304-3975(81)90055-4
OpenAlex ID: W2012313512
cites work: An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
cites work: A representation of trees by languages. II
cites work: On jump-deterministic pushdown automata
cites work: Completeness results for the equivalence of recursive schemas
cites work: Simple program schemes and formal languages
cites work: IO and OI. II
cites work: The inclusion problem for simple languages
cites work: Equivalence problems for deterministic context-free languages and monadic recursion schemes
cites work: Simple context-free languages and free monadic recursion schemes
cites work: Superdeterministic DPDAs: The method of accepting does affect decision problems
cites work: Recursion-closed algebraic theories
cites work: Q4197330
cites work: Regular trees and the free iterative theory
cites work: Q5725062
cites work: Initial Algebra Semantics and Continuous Algebras
cites work: Q4198075
cites work: Strict deterministic grammars
cites work: On the Parsing of Deterministic Languages
cites work: Q4116078
cites work: The decidability of equivalence for deterministic stateless pushdown automata
cites work: The equivalence problem for real-time strict deterministic languages
cites work: Tree-Manipulating Systems and Church-Rosser Theorems
cites work: Program equivalence and context-free grammars
cites work: A result on the equivalence problem for deterministic pushdown automata
cites work: Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
cites work: The equivalence problem for deterministic finite-turn pushdown automata
cites work: Deterministic one-counter automata
description: scientific article; zbMATH DE number 3744552