Complexity Theoretic Parallels Among Automata, Formal Languages and Real Variables Including Multi-Patterns, L-Systems and Cellular Automata
<p>In this dissertation, we emphasize productiveness not just undecidability since pro- ductiveness implies constructive incompleteness. Analogues of Rice?s Theorem for different classes of languages are investigated, refined and generalized. In particular, several sufficient but general condi...
| Main Author: | |
|---|---|
| Language: | EN |
| Published: |
State University of New York at Albany
2017
|
| Subjects: | |
| Online Access: | http://pqdtopen.proquest.com/#viewpdf?dispub=10272502 |