Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View history
Purge
English
Log in
Bounded AFLs
(Q1227455)
From MaRDI portal
Jump to:
navigation
,
search
scientific article
Language
Label
Description
Also known as
English
Bounded AFLs
scientific article
Statements
instance of
scholarly article
0 references
title
Bounded AFLs
(English)
0 references
author
Jonathan Goldstine
0 references
published in
Journal of Computer and System Sciences
0 references
publication date
1976
0 references
describes a project that uses
ALGOL 60
0 references
MaRDI profile type
MaRDI publication profile
0 references
cites work
Q5576254
0 references
Intersection-closed full AFL and the recursively enumerable languages
0 references
Q4066625
0 references
Principal AFL
0 references
Studies in abstract families of languages
0 references
Bounded Algol-Like Languages
0 references
Substitution and bounded languages
0 references
Some independent families of one-letter languages
0 references
Checking automata and one-way stack languages
0 references
Chains of full AFL's
0 references
Multitape AFA
0 references
What makes some language theory problems undecidable
0 references
Unending chess, symbolic dynamics and a problem in semi-groups
0 references
Three theorems concerning principal AFLs
0 references
full work available at URL
https://doi.org/10.1016/s0022-0000(76)80010-4
0 references
Identifiers
zbMATH Open document ID
0331.68043
0 references
DOI
10.1016/S0022-0000(76)80010-4
0 references
Mathematics Subject Classification ID
68Q45
0 references
zbMATH DE Number
3518292
0 references
OpenAlex ID
W2914943412
0 references
Sitelinks
Mathematics
(1 entry)
mardi
Publication:1227455
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Concept URI
