"Regularity of One-Letter Languages Acceptable by 2-Way Finite ..."

Janis Kaneps (1991)

> Home

Details and statistics

DOI: 10.1007/3-540-54458-5_73

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fct/Kaneps91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/Kaneps91
Janis Kaneps:
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. FCT 1991: 287-296

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.