Comparing language operations

DOI10.1007/BF01683281zbMATH Open0369.68042MaRDI QIDQ4146261FDOQ4146261

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

• Reversal-bounded multipushdown machines
• Title not available (Why is that?)
• Deterministic context free languages
• On Relations Defined by Generalized Finite Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Infinite Hierarchy of Context-Free Languages
• Finite-Turn Pushdown Automata
• Mappings of languages by two-tape devices
• Note on the boolean properties of context free languages
• Title not available (Why is that?)
• Checking automata and one-way stack languages
• Studies in abstract families of languages
• Chains of full AFL's
• Syntactic operators on full semiAFLs
• The Unsolvability of the Recognition of Linear Context-Free Languages
• Characteristic and ultrarealtime languages
• Substitution and bounded 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)