Intersection-closed full AFL and the recursively enumerable languages
From MaRDI portal
Publication:5684250
DOI10.1016/S0019-9958(73)90274-XzbMath0267.68035MaRDI QIDQ5684250
Seymour Ginsburg, Jonathan Goldstine
Publication date: 1973
Published in: Information and Control (Search for Journal in Brave)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (10)
On Boolean closed full trios and rational Kripke frames ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Recursivite et cônes rationnels fermés par intersection ⋮ A model for ergodic automorphisms on groups ⋮ On incomparable abstract family of languages (AFL) ⋮ Continuous operations on languages ⋮ Bounded AFLs ⋮ Classes of formal grammars ⋮ On simple generators of recursively enumerable languages
This page was built for publication: Intersection-closed full AFL and the recursively enumerable languages
