From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Foundations for Faster External Sorting (Extended Abstract).

V. Estivill-Castro, и D. Wood. FSTTCS, том 880 из Lecture Notes in Computer Science, стр. 414-425. Springer, (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Deterministic Regular LanguagesA. Brüggemann-Klein, и D. Wood. Universität Freiburg, Freiburg, Germany, (октября 1991)The generalization of generalized automata: expression automata.Y. Han, и D. Wood. Int. J. Found. Comput. Sci., 16 (3): 499-510 (2005)Precedence Relations in Grammar Forms.S. Ginsburg, и D. Wood. Acta Inf., (1978)EOL Forms.H. Maurer, A. Salomaa, и D. Wood. Acta Inf., (1977)Inverse Morphic Equivalence on Languages.J. Karhumäki, и D. Wood. Inf. Process. Lett., 19 (5): 213-218 (1984)Bounded Parallelism and Regular Languages.D. Wood. L Systems, том 15 из Lecture Notes in Computer Science, стр. 292-301. Springer, (1974)Grammars and L Forms: An IntroductionD. Wood. Lecture Notes in Computer Science Springer, (1980)WIA and Theory and Practice.D. Wood. Workshop on Implementing Automata, том 1436 из Lecture Notes in Computer Science, стр. 1-6. Springer, (1997)Intercode Regular Languages.Y. Han, K. Salomaa, и D. Wood. Fundam. Informaticae, 76 (1-2): 113-128 (2007)Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages.Y. Han, K. Salomaa, и D. Wood. Fundam. Informaticae, 90 (1-2): 93-106 (2009)