Complexity of checking whether two automata are synchronized by the same language.
Marina I. MaslennikovaPublished in: CoRR (2014)
Keyphrases
- programming language
- formal language theory
- cellular automata
- formal languages
- type checking
- language learning
- computational complexity
- database
- regular expressions
- worst case
- natural language
- high level
- learning algorithm
- data sets
- database systems
- temporal logic
- knowledge base
- space complexity
- turing machine
- neural network
- finite state automaton
- databases