Control sets on context-free grammar forms

DOI10.1016/S0022-0000(77)80026-3zbMath0359.68093MaRDI QIDQ1238638

Sheila A. Greibach

Publication date: 1977

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (20)

Some formal results about stratificational grammars and their relevance to linguistics ⋮ Representations of language families by homomorphic equality operations and generalized equality sets ⋮ The OI-hierarchy is closed under control ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tree transducers, L systems, and two-way machines ⋮ Reset machines ⋮ An approach to a unified theory of grammar and L forms ⋮ Langages sur des alphabets infinis ⋮ Iterated linear control and iterated one-turn pushdowns ⋮ Independance forte de certaines opérations ⋮ Formes de langages et de grammaires ⋮ Storage products and linear control of derivations ⋮ Basic tree transducers ⋮ One way finite visit automata ⋮ Pushdown acceptor forms ⋮ On languages specified by relative acceptance ⋮ UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES ⋮ Control sets on grammars using depth-first derivations ⋮ Derivation languages of grammar forms†

Cites Work

• Unnamed Item
• Unnamed Item
• Syntactic operators on full semiAFLs
• A geometric hierarchy of languages
• Reversal-bounded multipushdown machines
• Context-free grammar forms
• One way finite visit automata
• Left-derivation bounded languages
• Checking automata and one-way stack languages
• Scattered context grammars
• Derivation-bounded languages
• Principal AFL
• Finite-turn checking automata
• AFL with the semilinear property
• On certain formal properties of grammars
• Control sets on linear grammars
• Grammar Schemata
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Mappings which preserve context sensitive languages
• Finite-Turn Pushdown Automata
• The Unsolvability of the Recognition of Linear Context-Free Languages
• Control sets on grammars
• One-way stack automata
• An Infinite Hierarchy of Context-Free Languages
• Programmed Grammars and Classes of Formal Languages
• Quasi-realtime languages
• Studies in abstract families of languages
• Periodically time-variant context-free grammars
• Multitape AFA
• Phrase structure languages, finite machines, and channel capacity

This page was built for publication: Control sets on context-free grammar forms