From post

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

Unusual Algorithms for Lexicographical Enumeration.

P. Dömösi. Acta Cybern., 14 (3): 461-468 (2000)

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.

The Language of Primitive Words in not Regular: Two Simple Proofs.P. Dömösi, и G. Horváth. Bulletin of the EATCS, (2005)Parsing by Simple Insertion Systems.G. Enguix, P. Dömösi, и A. Krassovitskiy. ICAART (2), стр. 383-387. INSTICC Press, (2010)On α 2 - ν 2-products of automata.P. Dömösi, и G. Maróti. Acta Inf., 48 (7-8): 397-408 (2011)Some Remarks on Primitive Words and Palindromes.P. Dömösi, S. Horváth, M. Ito, и M. Katsura. DCFS, стр. 245-254. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary, (2003)A Parsing Problem for Context-Sensitive Languages.P. Dömösi, и M. Ito. Words, Languages & Combinatorics, стр. 183-184. World Scientific, (2000)Automata Networks without any Letichevsky Criteria.P. Dömösi. LATA, Report 35/07, стр. 237-248. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, (2007)On Product Hierarchies of Automata.P. Dömösi, Z. Ésik, и B. Imreh. FCT, том 380 из Lecture Notes in Computer Science, стр. 137-144. Springer, (1989)Unusual Algorithms for Lexicographical Enumeration.P. Dömösi. Acta Cybern., 14 (3): 461-468 (2000)On homomorphic simulation of automata by α0-products.P. Dömösi, и Z. Ésik. Acta Cybern., 8 (4): 315-323 (1988)Preface.P. Dömösi, и Z. Ésik. Int. J. Found. Comput. Sci., 23 (6): 1185-1188 (2012)