On two-dimensional pattern-matching languages and their decision problems

DOI10.1016/0020-0255(86)90012-5zbMath0628.68059OpenAlexW1978466648MaRDI QIDQ1093378

Kazuhiro Sugata, Kenichi Morita, Kaoru Nakazono

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0020-0255(86)90012-5

zbMATH Keywords

undecidabilitydecidabilityemptiness problemtwo-dimensional pattern matchinguniverse problemequivalence problemsexistential matching languagestwo-dimensional array languagesuniversal matching languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• A fast string searching algorithm
• Fast Pattern Matching in Strings
• Programming Techniques: Regular expression search algorithm

This page was built for publication: On two-dimensional pattern-matching languages and their decision problems