scientific article; zbMATH DE number 18634

MaRDI QIDQ3976037zbMATH OpenFDO

Authors Friedhelm Hinz

Publication date 26 June 1992

zbMATH Keywords

context-free languagemembership problemchain code picture languagesNP-algorithmsuperpicturethree-way picture languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Complexity and decidability for chain code picture languages
• The membership and equivalence problems for picture languages
• Membership problems for regular and context-free trace languages
• Two undecidability results for chain code picture languages
• Decision problems and regular chain code picture languages
• On the connectedness of pictures in chain code picture languages
• Publication:4206414
• On the Membership Problem for Visibly Pushdown Languages
• scientific article; zbMATH DE number 4001507
• Complexity and decidability for restricted classes of picture languages

Cited in

(6)

• Membership problems for regular and context-free trace languages
• Retreat bounded picture languages
• On reversal-bounded picture languages
• Complexity and decidability for chain code picture languages
• The membership and equivalence problems for picture languages
• Decision problems and regular chain code picture languages

This page was built for publication:

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