( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Validity of Weighted Automata.

, и . CIAA, том 10977 из Lecture Notes in Computer Science, стр. 41-45. Springer, (2018)

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.

Jacques Rakotondranary

Jacques Latta

Jacques Neumann

Jacques Mahoungou

Jacques Basmaji

 

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

Théorème de transversale rationnelle pour les automates à pile déterministes.. Theoretical Computer Science, том 67 из Lecture Notes in Computer Science, стр. 276-285. Springer, (1979)On the Representation of Finite Deterministic 2-Tape Automata., и . Theor. Comput. Sci., 225 (1-2): 1-63 (1999)On the decomposition of k-valued rational relations., и . STACS, том 1 из LIPIcs, стр. 621-632. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)Some operations and transductions that preserve rationality., и . Theoretical Computer Science, том 145 из Lecture Notes in Computer Science, стр. 277-288. Springer, (1983)Finite Automata and the Writing of Numbers.. Developments in Language Theory, том 4588 из Lecture Notes in Computer Science, стр. 29-30. Springer, (2007)The Removal of Weighted ε-Transitions., и . CIAA, том 7381 из Lecture Notes in Computer Science, стр. 345-352. Springer, (2012)The Language, the Expression, and the (Small) Automaton.. CIAA, том 3845 из Lecture Notes in Computer Science, стр. 15-30. Springer, (2005)The Validity of Weighted Automata., и . CIAA, том 10977 из Lecture Notes in Computer Science, стр. 41-45. Springer, (2018)An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages.. MFCS, том 45 из Lecture Notes in Computer Science, стр. 510-516. Springer, (1976)A Type System for Weighted Automata and Rational Expressions., , , , и . CIAA, том 8587 из Lecture Notes in Computer Science, стр. 162-175. Springer, (2014)