Erasing in context-free AFLs

DOI10.1016/S0019-9958(72)90133-7MaRDI QIDQ5661158zbMATH OpenFDO

Authors Sheila A. Greibach

Publication date 1972

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(72)90133-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Characterization of context-free languages by erasing automata
• scientific article; zbMATH DE number 1275848
• On elimination of erasing rules from E0S grammars
• scientific article; zbMATH DE number 897255
• On erasing productions in random context grammars
• Erasing in Petri Net Languages and Matrix Grammars
• Finitely distinguishable erasing pattern languages
• Cancellation in context-free languages: enrichment by reduction
• scientific article; zbMATH DE number 512829
• scientific article; zbMATH DE number 480523

Cited in

(15)

• Representations of language families by homomorphic equality operations and generalized equality sets
• Reset machines
• Langages satures et cônes decroissants. Langages et cônes bifideles
• One counter languages and the IRS condition
• Uniformly erasable AFL
• Classes of formal grammars
• Without Remnant Movement, MGs Are Context-Free
• Erasing in Petri Net Languages and Matrix Grammars
• Single-tape reset machines
• scientific article; zbMATH DE number 3688749 (Why is no real title available?)
• scientific article; zbMATH DE number 3602690 (Why is no real title available?)
• scientific article; zbMATH DE number 3604381 (Why is no real title available?)
• scientific article; zbMATH DE number 897255 (Why is no real title available?)
• Characterization of context-free languages by erasing automata
• On elimination of erasing rules from E0S grammars

This page was built for publication: Erasing in context-free AFLs

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