The complexity of a counting finite state automaton

  • Craig A. Rich
  • Giora Slutzki

Downloads

Download data is not yet available.
Published
1990-01-01
How to Cite
Rich, C. A., & Slutzki, G. (1990). The complexity of a counting finite state automaton. Acta Cybernetica, 9(4), 403-417. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3384
Issue
Vol 9 No 4 (1990)
Section
Regular articles