Continuous operations on languages

DOI10.1007/BF01768466zbMATH Open0364.68068MaRDI QIDQ4139699FDOQ4139699

Authors: Jonathan Goldstine 

Publication date: 1977

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Language identification in the limit
• Full AFLs and nested iterated substitution
• On incomparable abstract family of languages (AFL)
• Chains of full AFL's
• Intersection-closed full AFL and the recursively enumerable languages
• AFL with the semilinear property
• Some independent families of one-letter languages

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Continuous operations on languages

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