Digit set conversion by on-line finite automata

被引：4
|
作者：
Surarerks, A [1 ]
机构：
[1] Univ Paris 07, LIAFA, F-75251 Paris 05, France
来源：
BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN | 2001年 / 8卷 / 02期
关键词：
D O I：
10.36045/bbms/1102714177
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This paper is about numbers represented in positional notation, in integral or complex bases. We first give an abstract scheme of an on-line algorithm for digit set conversion in fixed base. Then we prove that in positive or negative integral base the digit set conversion is computable by an on-line finite state automaton. We also show similar results for complex numbers represented in the Penney number system or in the Knuth number system.
引用
收藏
页码：337 / 358
页数：22
相关论文
共 50 条
  • [21] SET THEORY AND ALGEBRAIC OPERATIONS ON FINITE AUTOMATA
    MELIKHOV, AN
    DVORYANT.YA
    ENGINEERING CYBERNETICS, 1967, (03): : 116 - &
  • [22] The verification of conversion algorithms between finite automata
    Dongchen JIANG
    Wei LI
    Science China(Information Sciences), 2018, 61 (02) : 243 - 256
  • [23] The verification of conversion algorithms between finite automata
    Dongchen Jiang
    Wei Li
    Science China Information Sciences, 2018, 61
  • [24] The verification of conversion algorithms between finite automata
    Jiang, Dongchen
    Li, Wei
    SCIENCE CHINA-INFORMATION SCIENCES, 2018, 61 (02)
  • [25] On-line monitoring of metric temporal logic with time-series constraints using alternating finite automata
    Drusinsky, Doron
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2006, 12 (05) : 482 - 498
  • [26] Application of Fractal theory for on-line and off-line farsi digit recognition
    Mozaffari, Saeed
    Faez, Karim
    Maergner, Volker
    MACHINE LEARNING AND DATA MINING IN PATTERN RECOGNITION, PROCEEDINGS, 2007, 4571 : 868 - +
  • [27] On-line algorithms for the dominating set problem
    Dept. of Comp. and Info. Science, National Chiao Tung University, Hsinchu 30050, Taiwan
    Inf. Process. Lett., 1 (11-14):
  • [28] On-line algorithms for the dominating set problem
    King, GH
    Tzeng, WG
    INFORMATION PROCESSING LETTERS, 1997, 61 (01) : 11 - 14
  • [29] On-line complexity of monotone set systems
    Kaplan, H
    Szegedy, M
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 507 - 516
  • [30] On-line independent set by coloring vertices
    Vangelis Th. Paschos
    Operational Research, 2001, 1 (3) : 213 - 224
12345