Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting.
Rudolf FreundSergiu IvanovLudwig StaigerPublished in: Int. J. Unconv. Comput. (2016)
Keyphrases
- regular languages
- context free
- turing machine
- finite automata
- grammatical inference
- regular expressions
- context sensitive
- context dependent
- regular tree languages
- finite state
- formal language theory
- expressive power
- context free grammars
- tree automata
- databases
- language independent
- inductive inference
- xml schema
- cellular automata
- hidden markov models
- finite state automata
- recursive functions
- rational kernels
- pattern matching
- machine intelligence
- cross lingual
- probabilistic automata
- linear separability