Strongly connected synchronizing automata and the language of minimal reset words.
Emanuele RodaroPublished in: Adv. Appl. Math. (2018)
Keyphrases
- strongly connected
- linguistic knowledge
- syntactic categories
- formal language theory
- directed graph
- formal languages
- language specific
- lexical information
- programming language
- cellular automata
- target language
- optimum path forest
- finite state machines
- language learning
- parallel corpus
- n gram
- natural language
- word forms
- keywords
- word sense disambiguation
- regular languages
- computational complexity
- social networks
- word segmentation
- connected components
- optimal solution
- objective function
- finite state automaton