Simple matrix languages with a leftmost restriction

DOI10.1016/S0019-9958(73)90627-XMaRDI QIDQ5677083zbMATH OpenFDO

Authors Hermann Maurer

Publication date 1973

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

Full work available at URL https://doi.org/10.1016/S0019-9958(73)90627-X

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(10)

• Classes of formal grammars
• On the generative capacity of simple matrix grammars of finite index
• On the generative capacity of tree controlled grammars
• Normal forms for context-sensitive grammars
• A note on leftmost restricted random context grammars
• One-sided random context grammars with leftmost derivations
• scientific article; zbMATH DE number 3817693 (Why is no real title available?)
• Size, index, and context-sensitivity of controlled partition grammars
• On the leftmost derviation in matrix grammars
• Simple matrix grammars and their leftmost variants

This page was built for publication: Simple matrix languages with a leftmost restriction

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