Inkdot versus Pebble over Two-Dimensional Languages
نویسندگان
چکیده
This paper investigates a relationship between inkdot and one-pebble for two-dimensional finite automata (2-fa’s). Especially we show that (1) alternating inkdot 2-fa’s are more powerful than nondeterministic one-pebble 2-fa’s, and (2) there is a set accepted by an alternating inkdot 2-fa, but not accepted by any alternating one-pebble 2-fa with only universal states. key words: inkdot, pebble, two-dimensional automata, nondeterminism, alternation
منابع مشابه
Marker versus Inkdot on Four-Dimensional Tapes
A multi-marker automaton is a finite automaton which keeps marks as pebbles in the finite control, and cannot rewrite any input symbols but can make marks on its input with the restriction that only a bounded number of these marks can exist at any given time. An improvement of picture recognizability of the finite automaton is the reason why the multi-marker automaton was introduced. On the oth...
متن کاملA Note on Two-pebble Automata Over Infinite Alphabets
It is shown that the emptiness problem for 2-pebble automata languages is undecidable and that 2-pebble automata are weaker than 3-pebble automata.
متن کاملTwo-way Automata and Regular Languages of Overlapping Tiles
In this paper, we show how the study of two-way automata on words may relevantly be extended to the study of two-way automata on one-dimensional overlapping tiles that generalize finite words. Indeed, over tiles, languages recognizable by finite two-way automata (resp. multi-pebble automata) coincide with languages definable by Kleene’s (resp. Kleene’s extended) regular expressions. As an immed...
متن کاملDeterminizing Two-way Alternating Pebble Automata for Data Languages
We prove that for every integer k ≥ 1, two-way alternating kpebble automata and one-way deterministic k-pebble automata for data languages have the same recognition power.
متن کاملOne Pebble Versus log(n) Bits
We show that, for any ε > 0, there exists a language accepted in strong ε·log n space by a 2-way deterministic Turing machine working with a single binary worktape, that cannot be accepted in sublogarithmicweak space by any pebble machine (i.e., a 2-way nondeterministic Turing machine with one pebble that can be moved onto the input cells). Moreover, we provide optimal unary lower bounds on the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 88-A شماره
صفحات -
تاریخ انتشار 2005