The complexity of some decision problems about two-dimensional array grammars

DOI10.1016/0020-0255(83)90027-0zbMath0572.68064OpenAlexW2012485375MaRDI QIDQ1062464

Kenichi Morita, Kazuhiro Sugata, Yasunori Yamamoto

Publication date: 1983

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(83)90027-0

zbMATH Keywords

equivalence problemmembership problemsemptiness problemcontext-free array grammarsregular array grammarstwo-dimensional isometric array grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

A CKY parser for picture grammars ⋮ A Three-Dimensional Uniquely Parsable Array Grammar that Generates and Parses Cubes

Cites Work

• Hierarchical Structures and Complexities of Parallel Isometric Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of some decision problems about two-dimensional array grammars