Equivalence problems for deterministic context-free languages and monadic recursion schemes
type: Item
instance of: scholarly article
title: Equivalence problems for deterministic context-free languages and monadic recursion schemes
zbMATH Open document ID: 0358.68109
DOI: 10.1016/S0022-0000(77)80019-6
author: Emily P. Friedman
published in: Journal of Computer and System Sciences
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3559012
MaRDI profile type: Publication
cites work: Decidable Properties of Monadic Functional Schemas
cites work: Q5526125
cites work: Q4146243
cites work: Deterministic context free languages
cites work: Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
cites work: Strict deterministic grammars
cites work: Q4072875
cites work: Real-Time Definable Languages
full work available at URL: s0022-0000(77)80019-6
OpenAlex ID: W2009721064
description: scientific article; zbMATH DE number 3559012