STRUCTURAL EXPANSION OF FINITE AUTOMATA LEADING TO EFFICIENT CHECK EXPERIMENTS

被引：0
|
作者：
MARINOV, JP
IVANOV, BC
机构：
来源：
AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA | 1978年 / 02期
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
引用
收藏
页码：13 / 18
页数：6
相关论文
共 50 条
  • [21] Efficient transformations from regular expressions to finite automata
    Seibert, S
    DEVELOPMENTS IN LANGUAGE THEORY, 2003, 2450 : 28 - 42
  • [22] Efficient instruction scheduling using finite state automata
    Bala, V
    Rubin, N
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1997, 25 (02) : 53 - 82
  • [23] Intensive in vitro experiments of implementing and executing finite automata in test tube
    Kuramochi, Junna
    Sakakibara, Yasubumi
    DNA COMPUTING, 2006, 3892 : 193 - 202
  • [24] Tax evasion behavior using finite automata: Experiments in Chile and Italy
    Garrido, Nicolas
    Mittone, Luigi
    EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (05) : 5584 - 5592
  • [25] An efficient algorithm for local testability problem of finite state automata
    Kim, SM
    McNaughton, R
    COMPUTING AND COMBINATORICS, 1995, 959 : 597 - 606
  • [26] Efficient search techniques for the inference of minimum size finite automata
    Oliveira, AL
    Silva, JPM
    STRING PROCESSING AND INFORMATION RETRIEVAL - PROCEEDINGS: A SOUTH AMERICAN SYMPOSIUM, 1998, : 81 - 89
  • [27] Efficient learning of typical finite automata from random walks
    Freund, Y
    Kearns, M
    Ron, D
    Rubinfeld, R
    Schapire, RE
    Sellie, L
    INFORMATION AND COMPUTATION, 1997, 138 (01) : 23 - 48
  • [28] An Efficient Parallel Determinisation Algorithm for Finite-state Automata
    Hanneforth, Thomas
    Watson, Bruce W.
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012, 2012, : 42 - 52
  • [29] STRUCTURAL PRESERVING MORPHISMS OF FINITE AUTOMATA AND AN APPLICATION TO GRAPH ISOMORPHISM
    YANG, CC
    IEEE TRANSACTIONS ON COMPUTERS, 1975, 24 (11) : 1133 - 1139
  • [30] An Easy to Check Characterization of Positive Expansivity for Additive Cellular Automata Over a Finite Abelian Group
    Dennunzio, Alberto
    Formenti, Enrico
    Margara, Luciano
    IEEE ACCESS, 2023, 11 : 121246 - 121255
12345