- 69 Downloads
The research on Tibetan spelling formal language and automata with application is related to set, function, graph, computer formal language and automata theory.
KeywordsDeterministic Pushdown Automata (DPDA) Context-sensitive Grammars Regular Grammars Unrestricted Grammars Read-write Head
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
© Science Press and Springer Nature Singapore Pte Ltd. 2019