FINITE COUNTING AUTOMATA

被引：22
|
作者：
SCHUTZENBERGER, MP
机构：
来源：
INFORMATION AND CONTROL | 1962年 / 5卷 / 02期
关键词：
D O I：
10.1016/S0019-9958(62)90244-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：91 / &
相关论文
共 50 条
  • [31] Applications of finite automata
    Karhumäki, J
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 40 - 58
  • [32] A CENSUS OF FINITE AUTOMATA
    HARRISON, MA
    CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (01): : 100 - &
  • [33] Opacities of finite automata
    Yao, JY
    DISCRETE MATHEMATICS, 1999, 202 (1-3) : 279 - 298
  • [34] Hairpin finite automata
    Bordihn, Henning
    Holzer, Markus
    Kutrib, Martin
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2007, 4588 : 108 - +
  • [35] Undecidability and Finite Automata
    Endrullis, Jorg
    Shallit, Jeffrey
    Smith, Tim
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2017, 2017, 10396 : 160 - 172
  • [36] Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata
    Leung, H
    SIAM JOURNAL ON COMPUTING, 1998, 27 (04) : 1073 - 1082
  • [37] On matrices, automata, and double counting in constraint programming
    Nicolas Beldiceanu
    Mats Carlsson
    Pierre Flener
    Justin Pearson
    Constraints, 2013, 18 : 108 - 140
  • [38] On matrices, automata, and double counting in constraint programming
    Beldiceanu, Nicolas
    Carlsson, Mats
    Flener, Pierre
    Pearson, Justin
    CONSTRAINTS, 2013, 18 (01) : 108 - 140
  • [39] Metric quantifiers and counting in timed logics and automata
    Ho, Hsi-Ming
    Madnani, Khushraj
    INFORMATION AND COMPUTATION, 2025, 303
  • [40] AUTOMATA ON INFINITE-TREES WITH COUNTING CONSTRAINTS
    BEAUQUIER, D
    NIWINSKI, D
    INFORMATION AND COMPUTATION, 1995, 120 (01) : 117 - 125
12345