( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On a Question of McNaughton and Papert

. Inf. Control., 25 (1): 93-101 (мая 1974)

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.

Antonio Wünsch

Antonio Accardi

Antonio Bergua

Antonio Pinto

Antonio Dell'Aquila

 

Другие публикации лиц с тем же именем

L-Convex Polyominoes: A Survey., и . Formal Models, Languages and Applications, том 66 из Series in Machine Perception and Artificial Intelligence, стр. 17-33. World Scientific, (2007)Forbidden Factors in Finite and Infinite Words., , и . Jewels are Forever, стр. 339-350. Springer, (1999)Some variations on Lyndon words., , и . CoRR, (2019)Sorting Suffixes of a Text via its Lyndon Factorization., , , и . Stringology, стр. 119-127. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)Une Caractérisation des Langages Algébriques Bornés., и . RAIRO Theor. Informatics Appl., 11 (3): 203-205 (1977)Mots Sans Répétitions et Langages Rationnels Bornés.. RAIRO Theor. Informatics Appl., 11 (3): 197-202 (1977)Automata with Extremal Minimality Conditions., и . Developments in Language Theory, том 6224 из Lecture Notes in Computer Science, стр. 399-410. Springer, (2010)On Some Properties of Very Pure Codes., и . Theor. Comput. Sci., (1980)Hopcroft's Algorithm and Tree-like Automata., , и . ICTCS, стр. 75-81. (2009)On Sets of Words of Rank Two., , и . WORDS, том 11682 из Lecture Notes in Computer Science, стр. 46-59. Springer, (2019)