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 条
  • [41] Regex Matching with Counting-Set Automata
    Turonova, Lenka
    Holik, Lukas
    Lengal, Ondrej
    Saarikivi, Olli
    Veanes, Margus
    Vojnar, Tomas
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (OOPSLA):
  • [42] Canonical number systems, counting automata and fractals
    Scheicher, K
    Thuswaldner, JM
    MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 2002, 133 : 163 - 182
  • [43] From Finite Automata to Fractal Automata - The Power of Recursion
    Nagy, Benedek
    MACHINES, COMPUTATIONS, AND UNIVERSALITY (MCU 2022), 2022, 13419 : 109 - 125
  • [44] On Stateless Multihead Finite Automata and Multihead Pushdown Automata
    Frisco, Pierluigi
    Ibarra, Oscar H.
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2009, 5583 : 240 - +
  • [45] FINITE AND COMBINATORIAL AUTOMATA - TURING AUTOMATA WITH A PROGRAMMING TAPE
    BECVAR, J
    COMMUNICATIONS OF THE ACM, 1962, 5 (06) : 319 - 319
  • [46] Counting Finite Lattices
    Jobst Heitzig
    Jürgen Reinhold
    algebra universalis, 2002, 48 : 43 - 53
  • [47] COUNTING FINITE POSETS
    NEGGERS, J
    ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1978, 31 (3-4): : 233 - 258
  • [48] Counting finite models
    Woods, AR
    JOURNAL OF SYMBOLIC LOGIC, 1997, 62 (03) : 925 - 949
  • [49] Counting finite lattices
    Heitzig, J
    Reinhold, J
    ALGEBRA UNIVERSALIS, 2002, 48 (01) : 43 - 53
  • [50] ON THE FINITE DEGREE OF AMBIGUITY OF FINITE TREE AUTOMATA
    SEIDL, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 395 - 404
12345