"On families recognizable by finite branching automata."

Václav Benda, Kamila Bendová (1977)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition @ kybernetika.cz (open access)
- export record
  dblp key:
  - journals/kybernetika/BendaB77
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/kybernetika/BendaB77
Václav Benda, Kamila Bendová:
On families recognizable by finite branching automata. Kybernetika 13(5): 293-319 (1977)

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.