Towards More Expressive 2D Deterministic Automata
نویسندگان
چکیده
REC defines an important class of picture languages that is considered a 2D analogous of regular languages. In this paper we recall some of the most expressive operational approaches to define deterministic subclasses of REC. We summarize their main characteristics and properties and try to understand if it is possible to combine their main features to define a larger deterministic subclass. We conclude by proposing a convenient generalization based on automata and study some of its formal properties.
منابع مشابه
The expressive power of analog recurrent neural networks on infinite input streams
We consider analog recurrent neural networks working on infinite input streams, provide a complete topological characterization of their expressive power, and compare it to the expressive power of classical infinite word reading abstract machines. More precisely, we consider analog recurrent neural networks as language recognizers over the Cantor space, and prove that the classes of ω-languages...
متن کاملExpressive Power of Pebble Automata
Two variants of pebble tree-walking automata on trees are considered that were introduced in the literature. It is shown that for each number of pebbles, the two models have the same expressive power both in the deterministic case and in the nondeterministic case. Furthermore, nondeterministic (resp. deterministic) treewalking automata with n+ 1 pebbles can recognize more languages than those w...
متن کاملCollapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata
We show that collapsible deterministic second level pushdown automata can recognize more languages than deterministic second level pushdown automata (without collapse). This implies that there exists a tree generated by a second level recursion scheme which is not generated by any second level safe recursion scheme. 1998 ACM Subject Classification F.4.3 Formal Languages Digital Object Identifie...
متن کاملUnranked Tree Automata with Sibling Equalities and Disequalities
We propose an extension of the tree automata with constraints between direct subtrees (Bogaert and Tison, 1992) to unranked trees. Our approach uses MSO-formulas to capture the possibility of comparing unboundedly many direct subtrees. Our main result is that the nonemptiness problem for the deterministic automata, as in the ranked setting, is decidable. Furthermore, we show that the nondetermi...
متن کاملBüchi VASS recognise w-languages that are Sigma^1_1 - complete
This short note exhibits an example of a Σ1-complete language that can be recognised by a one blind counter Büchi automaton (or equivalently a Büchi VASS with only one place). In this work we study the topological complexity of ω-languages recognised by vector addition systems with states equipped with Büchi acceptance condition (Büchi VASS). This model corresponds, from the automata theoretic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011