( en | de | ru )

 

Disambiguation of "Bertoni, Alberto"

Author of the publication

copydeleteadd this publication to your clipboard
Random Generation for Finitely Ambiguous Context-free Languages.

, , and . RAIRO Theor. Informatics Appl., 35 (6): 499-512 (2001)

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. You can also use the button next to the name to display some publications already assigned to the person.

Vanessa Bertoni

Juan Márquez Bertoni

Alberto Moreira

Alberto Coda

Alberto Fierro

 

Other publications of authors with the same name

Regularity of Languages Defined by Formal Series with Isolated Cut Point., , and . NCMA, volume 282 of books@ocg.at, page 73-87. Austrian Computer Society, (2011)Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem., , and . Developments in Language Theory, volume 7907 of Lecture Notes in Computer Science, page 82-93. Springer, (2013)On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages., and . RAIRO Theor. Informatics Appl., 32 (1-3): 79-98 (1998)Asymmetric Boltzmann machines., , , and . Biol. Cybern., 66 (1): 61-70 (1991)Learning functional linkage networks with a cost-sensitive approach., , , and . WIRN, volume 226 of Frontiers in Artificial Intelligence and Applications, page 52-61. IOS Press, (2010)A neural network algorithm for semi-supervised node label learning from unbalanced data., , , and . Neural Networks, (2013)A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation., , and . Algorithmica, 33 (1): 71-88 (2002)Implicit Parallelism in Genetic Algorithms., and . Artif. Intell., 61 (2): 307-314 (1993)Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures., , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 567-580. Springer, (2000)Grammatical compression: compressed equivalence and other problems., and . Discret. Math. Theor. Comput. Sci., 12 (4): 109-126 (2010)