"The number of DFAs for a given spanning tree."

Parisa Babaali, Edoardo Carta-Gerardino, Christopher Knaplund (2013)

> Home

Details and statistics

DOI: 10.1007/S11227-013-0957-0

access: closed

type: Journal Article

metadata version: 2020-05-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tjs/BabaaliCK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tjs/BabaaliCK13
Parisa Babaali, Edoardo Carta-Gerardino, Christopher Knaplund:
The number of DFAs for a given spanning tree. J. Supercomput. 65(2): 710-722 (2013)

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.