"The complexity of a counting finite-state automation."

Craig A. Rich, Giora Slutzki (1990)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-09-16

- view
  - electronic edition @ u-szeged.hu
- export record
  dblp key:
  - journals/actaC/RichS90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/actaC/RichS90
Craig A. Rich, Giora Slutzki:
The complexity of a counting finite-state automation. Acta Cybern. 9(4): 403-417 (1990)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.