FINITE AUTOMATA - DISCUSSION

被引：0
|
作者：
GEORGE, FH
机构：
来源：
PHILOSOPHY | 1958年 / 33卷 / 124期
关键词：
D O I：
10.1017/S0031819100038006
中图分类号：
B [哲学、宗教];
学科分类号：
01 ; 0101 ;
摘要：
引用
收藏
页码：57 / 59
页数：3
相关论文
共 50 条
  • [31] FINITE AND COMBINATORIAL AUTOMATA - TURING AUTOMATA WITH A PROGRAMMING TAPE
    BECVAR, J
    COMMUNICATIONS OF THE ACM, 1962, 5 (06) : 319 - 319
  • [32] ON THE FINITE DEGREE OF AMBIGUITY OF FINITE TREE AUTOMATA
    SEIDL, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 395 - 404
  • [33] FINITE AUTOMATA ON RECURSIVE CLOSURE OF FINITE GRAPHS
    REDKO, SE
    DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1981, (05): : 82 - 85
  • [34] ON THE FINITE DEGREE OF AMBIGUITY OF FINITE TREE AUTOMATA
    SEIDL, H
    ACTA INFORMATICA, 1989, 26 (06) : 527 - 542
  • [35] Normal numbers and finite automata
    Becher, Veronica
    Ariel Heiber, Pablo
    THEORETICAL COMPUTER SCIENCE, 2013, 477 : 109 - 116
  • [36] PROGRAMMABLE FINITE AUTOMATA FOR VLSI
    CULIK, K
    JURGENSEN, H
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1983, 14 (3-4) : 259 - 275
  • [37] Neutrosophic general finite automata
    Kavikumar, J.
    Nagarajan, D.
    Broumi, Said
    Smarandache, F.
    Lathamaheswari, M.
    Ebas, Nur Ain
    Neutrosophic Sets and Systems, 2019, 27 : 17 - 36
  • [38] Operations on Unambiguous Finite Automata
    Jirasek, Jozef, Jr.
    Jiraskova, Galina
    Sebej, Juraj
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016, 2016, 9840 : 243 - 255
  • [39] FINITE-MEMORY AUTOMATA
    KAMINSKI, M
    FRANCEZ, N
    THEORETICAL COMPUTER SCIENCE, 1994, 134 (02) : 329 - 363
  • [40] ON THE DEGREE OF AMBIGUITY OF FINITE AUTOMATA
    WEBER, A
    SEIDL, H
    THEORETICAL COMPUTER SCIENCE, 1991, 88 (02) : 325 - 349
12345