"Completely Reachable Automata: An Interplay Between Automata, Graphs, and ..."

Eugenija A. Bondar, David Casas, Mikhail V. Volkov (2023)

> Home

Details and statistics

DOI: 10.1142/S0129054123450053

access: closed

type: Journal Article

metadata version: 2023-11-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/BondarCV23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/BondarCV23
Eugenija A. Bondar, David Casas, Mikhail V. Volkov:
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees. Int. J. Found. Comput. Sci. 34(6): 655-690 (2023)

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.