"On the Computational Complexity of the Freezing Non-strict Majority Automata."

Eric Goles et al. (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-58631-1_9

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/automata/GolesMMO17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/automata/GolesMMO17
Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger:
On the Computational Complexity of the Freezing Non-strict Majority Automata. AUTOMATA 2017: 109-119

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.