The complexity of some decision problems about two-dimensional array grammars
From MaRDI portal
Publication:1062464
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
equivalence problemmembership problemsemptiness problemcontext-free array grammarsregular array grammarstwo-dimensional isometric array grammars
Related Items
A CKY parser for picture grammars ⋮ A Three-Dimensional Uniquely Parsable Array Grammar that Generates and Parses Cubes
Cites Work