An efficient representation for implementing finite state machines based on the double-array

被引：2
|
作者：
Mizobuchi, S
Sumitomo, T
Fuketa, M
Aoe, J
机构：
[1] Univ Tokushima, Fac Engn, Dept Informat Sci & Intelligent Syst, Tokushima 7708506, Japan
[2] Univ Tokushima, Grad Sch Engn, Tokushima 7708506, Japan
来源：
INFORMATION SCIENCES | 2000年 / 129卷 / 1-4期
关键词：
D O I：
10.1016/S0020-0255(00)00061-X
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper describes the double-array structure that is extended in order to apply it to general finite state machines. The double-array is an efficient data structure which combines time efficiency and space efficiency. However, the range of its application has been limited in the areas where a directed tree with labeled edges is used as the data structure. Here, the double-array structure is extended so that it can represent the graph structure and, furthermore, be operated dynamically. The presented method has been evaluated by theoretical observations, and its space efficiency is verified in our experiment. (C) 2000 Elsevier Science Inc. All rights reserved.
引用
收藏
页码：119 / 139
页数：21
相关论文
共 50 条
  • [1] An efficient key updating algorithm for double-array structure
    Oono, M
    Kadaya, K
    Fuketa, M
    Oda, M
    Harada, J
    Aoe, J
    [J]. 7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XII, PROCEEDINGS: INFORMATION SYSTEMS, TECHNOLOGIES AND APPLICATIONS: II, 2003, : 311 - 313
  • [2] AN EFFICIENT DIGITAL SEARCH ALGORITHM BY USING A DOUBLE-ARRAY STRUCTURE
    AOE, JI
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1989, 15 (09) : 1066 - 1077
  • [3] Trie Compact Representation using Double-array Structures with String Labels
    Kanda, Shunsuke
    Fuketa, Masao
    Morita, Kazuhiro
    Aoe, Jun-ichi
    [J]. 2015 IEEE 8TH INTERNATIONAL WORKSHOP ON COMPUTATIONAL INTELLIGENCE AND APPLICATIONS (IWCIA) PROCEEDINGS, 2015, : 3 - 8
  • [4] Implementing finite state machines in a computer based teaching system
    Hacker, CH
    Sitte, R
    [J]. EDUCATION IN MICROELECTRONICS AND MEMS, 1999, 3894 : 110 - 117
  • [5] Study for the Double-array Trie Tree Based Algorithm in Word Segmentation
    Yang, Wenchuan
    Fang, Zeyang
    Li, Pengfei
    [J]. INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENVIRONMENTAL ENGINEERING (CSEE 2015), 2015, : 440 - 446
  • [6] POLYNOMIAL REPRESENTATION OF FINITE-STATE MACHINES
    HUNT, BR
    [J]. IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1969, SSC5 (01): : 94 - &
  • [7] AN EFFICIENT VERIFIER FOR FINITE STATE MACHINES
    HWANG, SH
    NEWTON, AR
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1991, 10 (03) : 326 - 334
  • [8] A New Approach for Implementing Finite State Machines with Input Multiplexing
    Garcia-Vargas, Ignacio
    Senhadji-Navarro, Raouf
    [J]. ELECTRONICS, 2023, 12 (18)
  • [9] BAG OF ARCS: NEW REPRESENTATION OF SPEECH SEGMENT FEATURES BASED ON FINITE STATE MACHINES
    Watanabe, Shinji
    Kubo, Yotaro
    Oba, Takanobu
    Hori, Takaaki
    Nakamura, Atsushi
    [J]. 2012 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2012, : 4201 - 4204
  • [10] Implementing a text based method (Lingo) using Finite State Machines for fast similarity searching
    Grant, J. Andrew
    Haigh, James
    Sayle, Roger
    [J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2006, 232 : 26 - 26
12345