Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines.
Christian WurmPublished in: MOL (2011)
Keyphrases
- regular languages
- regular expressions
- finite automata
- grammatical inference
- context free grammars
- conjunctive regular path queries
- turing machine
- finite number
- positive data
- context free
- inductive inference
- finite state automata
- probabilistic automata
- learning machines
- machine learning
- finite state
- finite state machines
- social networks
- hypothesis space
- pac learning
- statistical queries
- context dependent
- desirable properties
- np hard
- preferential attachment
- database