On incomparable abstract family of languages (AFL)
From MaRDI portal
Publication:1210909
DOI10.1016/S0022-0000(74)80040-1zbMath0289.68038MaRDI QIDQ1210909
Seymour Ginsburg, Edwin H. Spanier
Publication date: 1974
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items (4)
Continuous operations on languages ⋮ A prime decomposition theorem for grammatical families ⋮ Hierarchies of hyper-AFLs ⋮ A note on non-generators of full afl's
Cites Work
- Unnamed Item
- Unnamed Item
- Syntactic operators on full semiAFLs
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Principal AFL
- Substitution in families of languages
- Full AFLs and nested iterated substitution
- Studies in abstract families of languages
- Chains of full AFL's
- Intersection-closed full AFL and the recursively enumerable languages
This page was built for publication: On incomparable abstract family of languages (AFL)
