Regular separability of one counter automata.
Wojciech CzerwinskiSlawomir LasotaPublished in: LICS (2017)
Keyphrases
- context free
- finite automata
- regular languages
- probabilistic automata
- cellular automata
- finite state
- dimensionality reduction
- regular expressions
- tree automata
- neural network
- formal language theory
- lattice gas
- data sets
- temporal logic
- face recognition
- computer vision
- learning algorithm
- information retrieval
- turing machine
- machine learning
- real world