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
关键词
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 条
  • [21] Observed Data-Based Model Construction of Finite State Machines Using Exponential Representation of LMs
    Yan, Yongyi
    Yue, Jumei
    Chen, Zengqiang
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2022, 69 (02) : 434 - 438
  • [22] State Encoding based NBTI Optimization in Finite State Machines
    Pendyala, ShiJpa
    Katkoori, Srinivas
    [J]. PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN ISQED 2016, 2016, : 416 - 422
  • [23] Implementing state machines in distributed event-based systems
    Zipper, Holger
    Meier, Marco
    Hintze, Elke
    Diedrich, Christian
    [J]. 2017 3RD INTERNATIONAL CONFERENCE ON EVENT-BASED CONTROL, COMMUNICATION AND SIGNAL PROCESSING (EBCCSP), 2017,
  • [24] A method of implementing UML virtual machines with some constraints based on abstract state machines
    Shen, WW
    Compton, K
    Huggins, J
    [J]. ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE, PROCEEDINGS, 2003, : 224 - 233
  • [25] Implementing Combined Finite State Machine with Heterogeneous Field Programmable Gate Array
    Hrushko, Svitlana
    [J]. 2018 14TH INTERNATIONAL CONFERENCE ON ADVANCED TRENDS IN RADIOELECTRONICS, TELECOMMUNICATIONS AND COMPUTER ENGINEERING (TCSET), 2018, : 1184 - 1187
  • [26] PARALLEL PARSING ON A ONE-WAY ARRAY OF FINITE-STATE MACHINES
    CHANG, JH
    IBARRA, OH
    PALIS, MA
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (01) : 64 - 75
  • [27] An efficient algorithm for Gaussian blur using finite-state machines
    Waltz, FM
    Miller, JWV
    [J]. MACHINE VISION SYSTEMS FOR INSPECTION AND METROLOGY VII, 1998, 3521 : 334 - 341
  • [28] Area-Efficient Fault Tolerant Design for Finite State Machines
    Choi, Soyeon
    Park, Jiwoon
    Yoo, Hoyoung
    [J]. 2020 INTERNATIONAL CONFERENCE ON ELECTRONICS, INFORMATION, AND COMMUNICATION (ICEIC), 2020,
  • [29] Deriving complete finite tests based on state machines
    Burdonov, Igor
    Kossatchev, Alexander
    Yevtushenko, Nina
    [J]. 2014 IEEE EAST-WEST DESIGN & TEST SYMPOSIUM (EWDTS), 2014,
  • [30] Quantum Finite State Machines - a Circuit Based Approach
    Lukac, Martin
    Kameyama, Michitaka
    Perkowski, Marek
    [J]. INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING, 2013, 9 (3-4) : 267 - 301