FINITE COUNTING AUTOMATA

被引：21
|
作者：
SCHUTZENBERGER, MP
机构：
来源：
INFORMATION AND CONTROL | 1962年 / 5卷 / 02期
关键词：
D O I：
10.1016/S0019-9958(62)90244-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：91 / &
相关论文
共 50 条
  • [1] Counting with probabilistic and ultrametric finite automata
    Balodis, Kaspars, 1600, Springer Verlag (8808):
  • [2] Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
    Yamakami, Tomoyuki
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2023, 2023, 14292 : 421 - 435
  • [3] AUTOMATA AND FINITE AUTOMATA
    LEE, CY
    BELL SYSTEM TECHNICAL JOURNAL, 1960, 39 (05): : 1267 - 1295
  • [4] FINITE AUTOMATA, REAL-TIME PROCESSES AND COUNTING PROBLEMS IN BOUNDED ARITHMETICS
    KUTYLOWSKI, M
    JOURNAL OF SYMBOLIC LOGIC, 1988, 53 (01) : 243 - 258
  • [5] k-COUNTING AUTOMATA
    Allred, Joel
    Ultes-Nitsche, Ulrich
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2012, 46 (04): : 461 - 478
  • [6] On Matrices, Automata, and Double Counting
    Beldiceanu, Nicolas
    Carlsson, Mats
    Flener, Pierre
    Pearson, Justin
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, 2010, 6140 : 10 - +
  • [7] CLASS COUNTING AUTOMATA ON DATAWORDS
    Manuel, Amaldev
    Ramanujam, R.
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (04) : 863 - 882
  • [8] Simulation of Automata over a Finite Ring by the Automata with a Finite Memory
    Skobelev, V. V.
    JOURNAL OF AUTOMATION AND INFORMATION SCIENCES, 2012, 44 (05) : 57 - 66
  • [9] Counting and equality constraints for multitree automata
    Lugiez, D
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2003, 2620 : 328 - 342
  • [10] Counting Cycles in Reversible Cellular Automata
    Das, Sukanta
    Chakraborty, Avik
    Sikdar, Biplab K.
    CELLULAR AUTOMATA, ACRI 2012, 2012, 7495 : 11 - 19
12345