Slender Siromoney matrix languages

DOI10.1016/j.ic.2008.03.024zbMath1328.68107OpenAlexW2036586771MaRDI QIDQ948096

Ralf Stiebe

Publication date: 8 October 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.024

zbMATH Keywords

decidabilitypattern matchingtwo-dimensional languagesslender languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Pure 2D picture grammars and languages ⋮ Two-dimensional models

Cites Work

• Language-theoretic problems arising from Richelieu cryptosystems
• On a conjecture about slender context-free languages
• Length considerations in context-free languages
• On lengths of words in context-free languages
• Parallel/sequential rectangular arrays with tables
• A characterization of poly-slender context-free languages
• A helpful result for proving inherent ambiguity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Slender Siromoney matrix languages