Autor:	Liebehenschel, Jens
Jazyk:	angličtina
Rok vydání:	2003
Předmět:	Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) Computer Science::Formal Languages and Automata Theory
DOI:	10.25596/jalc-2003-051
Popis:	Assuming that all words of a given length in a language are equally likely, we point out a connection between the average costs for the lexicographical generation and the average costs for the ranking of these words. Journal of Automata, Languages and Combinatorics, Volume 8, Number 1, 2003, 51-57
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::2ee36880b3f9fc1415d55aecfcc7a59a Zobrazit plný text záznamu