Unavoidable set : extension and reduction
Previous Page 3
Displaying 41 – 44 of 44
Unavoidable Set: Extension and Reduction
Phan Trung Huy, Nguyen Huong Lam (2010)
RAIRO - Theoretical Informatics and Applications
We give an explicit criterion for unavoidability of word sets. We characterize extendible, finitely and infinitely as well, elements in them. We furnish a reasonable upper bound and an exponential lower bound on the maximum leghth of words in a reduced unavoidable set of a given cardinality.
К моделированию синтеза простых предложений на естественном языке
Т.И. Ибрагимов (1980)
Verojatnostnye metody i kibernetika
Об одном возможном подходе к вопросу автоматического синтаксического анализа предложных и беспредложных именных конструкций чешского языка
N. A. Paščenko (1966)
Kybernetika
Currently displaying 41 – 44 of 44
Previous Page 3