Multihead Finite Automata with Markers
Summary :
This paper introduces a new class of machines called multihead marker finite automata, and investigates how the number of markers affects its accepting power. Let HM{0}(i, j)(NHM{0}(i, j))denote the class of languages over a one-letter alphabet accepted by two-way deterministic (nondeterminstic) i-head finite automata with j markers. We show that HM{0} (i, j)
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.4 pp.615-620
- Publication Date
- 1994/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yue WANG, Katsushi INOUE, Itsuo TAKANAMI, "Multihead Finite Automata with Markers" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 4, pp. 615-620, April 1994, doi: .
Abstract: This paper introduces a new class of machines called multihead marker finite automata, and investigates how the number of markers affects its accepting power. Let HM{0}(i, j)(NHM{0}(i, j))denote the class of languages over a one-letter alphabet accepted by two-way deterministic (nondeterminstic) i-head finite automata with j markers. We show that HM{0} (i, j)
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_4_615/_p
Copy
@ARTICLE{e77-a_4_615,
author={Yue WANG, Katsushi INOUE, Itsuo TAKANAMI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Multihead Finite Automata with Markers},
year={1994},
volume={E77-A},
number={4},
pages={615-620},
abstract={This paper introduces a new class of machines called multihead marker finite automata, and investigates how the number of markers affects its accepting power. Let HM{0}(i, j)(NHM{0}(i, j))denote the class of languages over a one-letter alphabet accepted by two-way deterministic (nondeterminstic) i-head finite automata with j markers. We show that HM{0} (i, j)
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Multihead Finite Automata with Markers
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 615
EP - 620
AU - Yue WANG
AU - Katsushi INOUE
AU - Itsuo TAKANAMI
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1994
AB - This paper introduces a new class of machines called multihead marker finite automata, and investigates how the number of markers affects its accepting power. Let HM{0}(i, j)(NHM{0}(i, j))denote the class of languages over a one-letter alphabet accepted by two-way deterministic (nondeterminstic) i-head finite automata with j markers. We show that HM{0} (i, j)
ER -
English
