Inkdot versus Pebble over Two-Dimensional Languages

Atsuyuki INOUE; Akira ITO; Kunihiko HIRAISHI; Katsushi INOUE

doi:10.1093/ietfec/e88-a.5.1173

Inkdot versus Pebble over Two-Dimensional Languages

Atsuyuki INOUE, Akira ITO, Kunihiko HIRAISHI, Katsushi INOUE

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.5 pp.1173-1180

Publication Date: 2005/05/01

Publicized

Online ISSN

DOI: 10.1093/ietfec/e88-a.5.1173

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category

Cite this

Copy

Atsuyuki INOUE, Akira ITO, Kunihiko HIRAISHI, Katsushi INOUE, "Inkdot versus Pebble over Two-Dimensional Languages" in IEICE TRANSACTIONS on Fundamentals, vol. E88-A, no. 5, pp. 1173-1180, May 2005, doi: 10.1093/ietfec/e88-a.5.1173.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.5.1173/_p

Copy

@ARTICLE{e88-a_5_1173,
author={Atsuyuki INOUE, Akira ITO, Kunihiko HIRAISHI, Katsushi INOUE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Inkdot versus Pebble over Two-Dimensional Languages},
year={2005},
volume={E88-A},
number={5},
pages={1173-1180},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e88-a.5.1173},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - Inkdot versus Pebble over Two-Dimensional Languages
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1173
EP - 1180
AU - Atsuyuki INOUE
AU - Akira ITO
AU - Kunihiko HIRAISHI
AU - Katsushi INOUE
PY - 2005
DO - 10.1093/ietfec/e88-a.5.1173
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2005
AB - 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.
ER -