Comparing language operations

DOI10.1007/BF01683281MaRDI QIDQ4146261zbMATH OpenFDO

Authors Stephen Y. Itoga

Publication date 1977

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3141365 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3197115 (Why is no real title available?)
• An Infinite Hierarchy of Context-Free Languages
• Chains of full AFL's
• Characteristic and ultrarealtime languages
• Checking automata and one-way stack languages
• Deterministic context free languages
• Finite-Turn Pushdown Automata
• Mappings of languages by two-tape devices
• Note on the boolean properties of context free languages
• On Relations Defined by Generalized Finite Automata
• Reversal-bounded multipushdown machines
• Studies in abstract families of languages
• Substitution and bounded languages
• Syntactic operators on full semiAFLs
• The Unsolvability of the Recognition of Linear Context-Free Languages

Cited in

(1)

• On languages specified by relative acceptance

This page was built for publication: Comparing language operations

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