Yield-languages of two-way pushdown tree automata
type: Item
instance of: scholarly article
title: Yield-languages of two-way pushdown tree automata
zbMATH Open document ID: 1004.68531
DOI: 10.1016/0020-0190(96)00048-8
author: Kai Salomaa
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 984594
zbMATH Keywords: formal languages
zbMATH Keywords: tree automaton
zbMATH Keywords: pushdown automaton
zbMATH Keywords: recursively enumerable sets
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00048-8
OpenAlex ID: W2046869989
cites work: Indexed Grammars—An Extension of Context-Free Grammars
cites work: A Purely Homomorphic Characterization of Recursively Enumerable Sets
cites work: Tree transducers, L systems, and two-way machines
cites work: Stack automata and compiling
cites work: Two-way pushdown automata
cites work: Pushdown tree automata
cites work: On two-way tree automata
cites work: Tree pushdown automata
cites work: Alternating tree automata
cites work: Top-down tree transducers with two-way tree walking look-ahead
description: scientific article; zbMATH DE number 984594