On incomparable abstract family of languages (AFL)

Authors:
Seymour Ginsburg;Edwin H. Spanier
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1974

Citing 4
Cited 0

Algebraic and Automata-Theoretic Properties of Formal Languages

Algebraic and Automata-Theoretic Properties of Formal Languages
Substitution in families of languages

Information Sciences: an International Journal
Principal AFL

Journal of Computer and System Sciences
Syntactic operators on full semiAFLs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an abstract family of languages (AFL) @? the question is considered if there exists an AFL incomparable with @?. In case there is an AFL @?' incomparable with @? the paper considers if there exists a largest AFL incomparable with @?, and if there is a maximal AFL containing @?' incomparable with @?. The main results characterize those full AFL @?' having a largest full incomparable AFL @?' and relate properties of @? to properties of @?'.