"On the complexity of codes and pre-codes assigned to finite Moore automata."

András Ádám (1981)

> 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/Adam81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/actaC/Adam81
András Ádám:
On the complexity of codes and pre-codes assigned to finite Moore automata. Acta Cybern. 5(2): 117-133 (1981)

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.