On incomparable abstract family of languages (AFL)

DOI10.1016/S0022-0000(74)80040-1MaRDI QIDQ1210909zbMATH OpenFDO

Authors Seymour Ginsburg, Edwin H. Spanier

Publication date 1974

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0022-0000(74)80040-1

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Chains of full AFL's
• Full AFLs and nested iterated substitution
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• scientific article; zbMATH DE number 3248028 (Why is no real title available?)
• Intersection-closed full AFL and the recursively enumerable languages
• Principal AFL
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Studies in abstract families of languages
• Substitution in families of languages
• Syntactic operators on full semiAFLs

Cited in

(4)

• Hierarchies of hyper-AFLs
• A note on non-generators of full afl's
• Continuous operations on languages
• A prime decomposition theorem for grammatical families

This page was built for publication: On incomparable abstract family of languages (AFL)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1210909)