Complexity of Checking Whether Two Automata Are Synchronized by the Same Language.
Marina I. MaslennikovaPublished in: DCFS (2014)
Keyphrases
- formal language theory
- cellular automata
- computational complexity
- programming language
- language learning
- consistency checking
- finite state machines
- regular expressions
- formal languages
- finite automata
- operational semantics
- language processing
- finite state
- data sets
- np complete
- computational cost
- natural language
- artificial intelligence