کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
435481 689910 2016 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Non-recursive trade-offs between two-dimensional automata and grammars
ترجمه فارسی عنوان
بازپرداخت غیر مجاز بین اتوماتای ​​دو بعدی و گرامرها
کلمات کلیدی
زبان های تصویری اتوماتای ​​چهارگانه، گرامرهای دو بعدی بدون متن، پیچیدگی توصیفی بازخورد غیر مجاز
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
چکیده انگلیسی


• Succinctness of descriptional systems for picture languages is studied.
• Basic models of two-dimensional automata and grammars are considered.
• It is shown that non-recursive trade-offs are a common phenomenon.
• The results are based on the ability of the models to simulate Turing machines.

We study succinctness of descriptional systems for picture languages. Basic models of two-dimensional finite automata and generalizations of context-free grammars are considered. They include the four-way automaton of Blum and Hewitt, the two-dimensional online tessellation automaton of Inoue and Nakamura and the context-free Kolam grammar of Siromoney et al. We show that non-recursive trade-offs between the systems are very common. Basically, each separation result proving that one system describes a picture language which cannot be described by another system can usually be turned into a non-recursive trade-off result between the systems. These findings are strongly based on the ability of the systems to simulate Turing machines.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 610, Part A, 11 January 2016, Pages 121–132
نویسندگان
,