Bounded AFLs
type: Item
instance of: scholarly article
title: Bounded AFLs
zbMATH Open document ID: 0331.68043
DOI: 10.1016/S0022-0000(76)80010-4
author: Jonathan Goldstine
published in: Journal of Computer and System Sciences
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3518292
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
cites work: Q5576254
cites work: Intersection-closed full AFL and the recursively enumerable languages
cites work: Q4066625
cites work: Principal AFL
cites work: Studies in abstract families of languages
cites work: Bounded Algol-Like Languages
cites work: Substitution and bounded languages
cites work: Some independent families of one-letter languages
cites work: Checking automata and one-way stack languages
cites work: Chains of full AFL's
cites work: Multitape AFA
cites work: What makes some language theory problems undecidable
cites work: Unending chess, symbolic dynamics and a problem in semi-groups
cites work: Three theorems concerning principal AFLs
full work available at URL: s0022-0000(76)80010-4
OpenAlex ID: W2914943412
description: scientific article; zbMATH DE number 3518292