The paper restates known results to argue that evolutionary automata accept all languages by hard-coding them, but admits the construction fails for undecidable languages.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Evolutionary Automata and Deep Evolutionary Computation
The paper restates known results to argue that evolutionary automata accept all languages by hard-coding them, but admits the construction fails for undecidable languages.