@article{ITA_2006__40_2_R5_0,
author = {Campadelli, Paola and Choffrut, Christian and Goldwurm, Massimiliano and Torelli, Mauro},
title = {Preface},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
volume = {40},
year = {2006},
pages = {v-xiii},
doi = {10.1051/ita:2006018},
mrnumber = {2252630},
zbl = {1117.01301},
language = {en},
url = {http://dml.mathdoc.fr/item/ITA_2006__40_2_R5_0}
}
Campadelli, Paola; Choffrut, Christian; Goldwurm, Massimiliano; Torelli, Mauro. Preface. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 40 (2006) pp. v-xiii. doi : 10.1051/ita:2006018. http://gdmltest.u-ga.fr/item/ITA_2006__40_2_R5_0/
[1] ,,, and, A neural circuit for the maximum 2-satisfiability problem, in 3rd Euromicro Workshop on Parallel and Distributed Processing (PDP '95), IEEE Computer Society (1995) 319-323.
[2] ,,, and, A neural algorithm for max-2sat: Performance analysis and circuit implementation. Neural Networks 10 (1997) 555-560.
[3] and, Two-way probabilistic automata and rational power series, in Proceedings of the Fourth Italian Conference on Theoretical Computer Science. World Scientific (1992) 9-23.
[4] ,, and, Neural networks: Deterministic and stochastic dynamics, in Proceedings of a Workshop on Dynamics and Stochastic Processes. Lect. Notes Phys. 335 (1989) 27-41. | Zbl 0727.68092
[5] ,, and, Binary networks with parallel updating, in Proceedings of the 3rd Italian Workshop on Parallel Architectures and Neural Networks, edited by E.R. Caianiello. World Scientific (1990) 47-56.
[6] ,, and, Asymmetric boltzmann machines. Biological Cybernetic 66 (1991) 61-70. | Zbl 0753.92001
[7] ,, and, Lyapunov functions and neural networks, in Parallel Architectures and Neural Networks. Proceedings of the Second Italian Workshop, edited by E.R. Caianiello. World Scientific (1990) 53-67. | Zbl 0939.68780
[8] ,, and, Formal models of learning from examples, in Proceedings of the 5th Italian Workshop on Parallel Architectures and Neural Networks, edited by E.R. Caianiello. World Scientific (1992) 47-76.
[9] , and, A discrete neural algorithm for the maximum clique problem: Analysis and circuit implementation, in Workshop on Algorithm Engineering (WAE'97), edited by S. Orlando Giuseppe and F. Italiano (1997) 84-91.
[10] , and, An approximation algorithm for the Maximum Cut problem and its experimental analysis, in Workshop on Algorithms and Experiments (ALEX'98), edited by R. Battiti and A. Bertossi (1998).
[11] , Automi pesati ad interpretazione massimale, in Atti del Congresso di Cibernetica, edited by M.A. Baldocchi and F. Lenci. Felici (1971) 655-672.
[12] , Complexity problems related to the approximation of probabilistic languages and events by deterministic machines, in ICALP, Automata, Languages and Programming, Colloquium, Paris, edited by M. Nivat. North-Holland (1972) 507-516. | Zbl 0283.68050
[13] , Equations of formal power series over non commutative semiring, in MFCS, Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, Strbské Pleso (1973) 185-190.
[14] , Grammatiche context-free su spazi metrici compatti, in Atti del Convegno AICA di Informatica Teorica, Editrice Tecnico Scientifica (1973) 327-351.
[15] , Grammatiche pesate ed applicazioni, in Atti del Convegno AICA di Informatica Teorica, Editrice Tecnico Scientifica (1974) 117-137.
[16] , Mathematical methods of the theory of stochastic automata, in MFCS, Mathematical Foundations of Computer Science, 3rd Symposium, edited by A. Blikle. Springer, Lect. Notes Comput. Sci. 28 (1974) 9-22. | Zbl 0327.94068
[17] , The solution of problems relative to probabilistic automata in the frame of the formal languages theory, in GI - 4. Jahrestagung, Berlin, edited by D. Siefkes. Springer, Lect. Notes Comput. Sci. 26 (1974) 107-112. | Zbl 0327.94069
[18] , Model theoretic aspects of abstract data specification, in Mathematical Logic in Computer Science, edited by B. Dömölki and T. Gergely. North-Holland (1981) 181-193. | Zbl 0503.68013
[19] ,, and, On characterizing classes of efficiently parallelizable problems, in VLSI: Algorithms and Architectures, edited by P. Bertolazzi and F. Luccio. North-Holland (1985) 13-26. | Zbl 0567.68031
[20] ,, and, An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages, in Mathematical Foundations of Computer Science 1981, edited by J. Gruska and M. Chytil. Springer, Lect. Notes Comput. Sci. 118 (1981) 205-215. | Zbl 0468.68081
[21] , and, Stabilization and size of attraction basins in symmetric networks, in Parallel Architectures and Neural Networks. Proceedings of the Fourth Italian Workshop, edited by E.R. Caianiello. World Scientific (1991) 281-284.
[22] , and, Ranking and formal power series. Theor. Comput. Sci. 79 (1991) 25-35. | Zbl 0721.68023
[23] ,,, and, Generalized Boolean hierarchies and Boolean hierarchies over RP (Conference Abstract), in Fundamentals of Computation Theory, International Conference FCT'89, edited by J. Csirik, J. Demetrovics and F. Gécseg. Springer, Lect. Notes Comput. Sci. 380 (1989) 35-46. | Zbl 0756.68037
[24] and, Neural networks and non-uniform circuits, in Parallel Architectures and Neural Networks, in Proceedings of the First Italian Workshop, edited by E.R. Caianiello. World Scientific (1989) 18-27.
[25] and, Analysis of parallel and sequential Boltzmann machines, in Proceedings of the International Neural Networks Conference, Parigi (1990).
[26] and, Formal models of learning from examples, in Proceedings of ICANN94. Springer-Verlag (1992) 1157-1160.
[27] ,, and, A genetic model and the Hopfield networks, in Artificial Neural Networks - ICANN 96, edited by C. von der Malsburg, W. von Seelen, J.C. Vorbrüggen and B. Sendhoff. Springer, Lect. Notes Comput. Sci. 1112 (1996) 463-468.
[28] ,, and, Analysis of a genetic model, in Proceedings of the 7th International Conference on Genetic Algorithms, East Lansing, MI, USA, July 19-23, 1997, edited by T. Bäck. Morgan Kaufmann (1997) 121-126.
[29] ,, and, A genetic model: Analysis and application to maxsat. Evol. Comput. 8 (2000) 291-309.
[30] , and, Multilayer perceptrons and learning, in Proceedings of the 5th Italian Conference on Theoretical Computer Science, edited by A. De Santis. World Scientific (1996) 43-76.
[31] ,, and, Approximability of the ground state problem for certain Ising spin glasses. J. Complexity 13 (1997) 326-329. | Zbl 1017.82011
[32] , and, Full parallelism in Boltzmann machines, in Proceedings of NeuroNimes89: International Workshop on Neural Networks and their Applications (1989) 361-370.
[33] , and, An approximation algorithm for the maximum cut problem and its experimental analysis. Discrete Appl. Math. 110 (2001) 3-12.
[34] , and, A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation. Algorithmica 33 (2002) 71-88. | Zbl 0994.68002
[35] , and, Solving min vertex cover with iterated Hopfield networks, in Proceedings of the 12th Italian Workshop on Neural Nets, edited by R. Tagliaferri and M. Marinaro. Springer (2002) 87-95.
[36] , and, Robust learning by means of single neurons, in Neural Nets, WIRN Vietri '93: Sixth Italian Workshop, edited by E.R. Caianiello. World Scientific (1994) 192-198.
[37] , and, Some notes on computational learning theory. Bulletin of the EATCS 43 (1991) 140-158. | Zbl 0744.68110
[38] , and, PAC learning and neural networks, in Proceedings of the Conference on Structure from Physics to General System, edited by G. Scarpetta and M. Marinaro. World Scientific (1992) 48-63.
[39] , and, On the approximability of the energy function of Ising spin glasses. J. Phys. A: Math. Gen. 27 (1994) 6719-6729. | Zbl 0850.82058
[40] , and, Total stabilization in symmetric networks, in Proceedings of NeuroNimes88: International Workshop on Neural Networks and their Applications (1988) 183-197.
[41] ,, and, Polynomial uniform convergence of relative frequencies to probabilities, in Advances in Neural Information Processing Systems 4, NIPS, edited by J.E. Moody, S.J. Hanson and R. Lippmann. Morgan Kaufmann (1991) 904-911.
[42] ,, and, Polynomial uniform convergence and polynomial-sample learnability, in COLT (1992) 265-271.
[43] ,, and, An algorithm for learning from positive examples classes of linearly separable Boolean functions, in Parallel Architectures and Neural Networks, in Proceedings of the Fourth Italian Workshop, edited by E.R. Caianiello. World Scientific (1991) 11-19.
[44] ,, and, An algorithm for learning from positive examples classes of linearly separable Boolean functions, in Proceedings of the 4th Italian Workshop on Parallel Architectures and Neural Networks, edited by E.R. Caianiello. World Scientific (1991) 11-19.
[45] , and, Learnability by fixed distributions: An information theoretic approach, in Proceedings of the Fourth Italian Conference on Theoretical Computer Science. World Scientific (1992) 68-79.
[46] , and, A boosting algorithm for regression, in Artificial Neural Networks - ICANN '97, edited by W. Gerstner, A. Germond, M. Hasler and J.-D. Nicoud. Springer, Lect. Notes Comput. Sci. 1327 (1997) 343-348.
[47] , and, Polynomial time approximation of min-energy in Hopfield networks, in Proceedings of the 7th Italian Workshop on Parallel Architectures and Neural Networks, edited by R. Tagliaferri and M. Marinaro. World Scientific (1995) 165-170.
[48] , and, An upper bound for the maximum cut mean value, in Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, edited by R.H. Möhring. Springer, Lect. Notes Comput. Sci. 1335 (1997) 78-84. | Zbl 0889.05069
[49] , and, Analysis of a genetic model with finite populations, in Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part III, edited by L. Wang, K. Chen and Y.-S. Ong. Springer, Lect. Notes Comput. Sci. 3612 (2005) 235-244.
[50] ,, and, Approximability of ground state problem on tridimensional Ising spin glasses, in Proceedings of the 5th Italian Conference on Theoretical Computer Science, edited by A. De Santis. World Scientific (1996) 492-496.
[51] and, Analogies and differences between quantum and stochastic automata. Theor. Comput. Sci. 262 (2001) 69-81. | Zbl 0983.68094
[52] and, Regular languages accepted by quantum automata. Inf. Comput. 165 (2001) 174-182. | Zbl 1003.68061
[53] , and, Efficient learning with equivalence queries of conjunctions of modulo functions. Inf. Process. Lett. 56 (1995) 15-17. | Zbl 0875.68732
[54] ,, and, On the number of occurrences of a symbol in words of regular languages. Theor. Comput. Sci. 1-3 (2003) 431-456. | Zbl 1044.68083
[55] ,, and, Local limit distributions in pattern statistics: Beyond the markovian models, in STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, edited by V. Diekert and M. Habib. Lect. Notes Comput. Sci. 2996 (2004) 117-128. | Zbl 1122.68464
[56] ,, and, Local limit properties for pattern statistics and rational models. Theory Comput. Syst. 39 (2006) 209-235. | Zbl 1101.68085
[57] and, Sulla natura dell'insieme di una copertura dei punti razionali, Rend. Sci., Istituto Lombardo, Accademia di Scienze e Lettere A 127 (1994) 227-232. | Zbl 1043.11505
[58] and, Implicit parallelism in genetic algorithms. Artif. Intell. 61 (1993) 307-314. | Zbl 0781.68093
[59] , and, Feature selection combined with random subspace ensemble for gene expression based diagnosis of malignancies, in 15th Italian Workshop on Neural Nets, WIRN 2004, Università di Perugia (2004).
[60] , and, Biomolecular cancer prediction with random subspaces ensembles of support vector machines. Neurocomputing 63 (2005) 535-539.
[61] and, On the prefixes of a random trace and the membership problem for context-free trace languages, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 5th International Conference, AAECC-5, edited by L. Huguet and A. Poli. Springer, Lect. Notes Comput. Sci. 356 (1987) 35-59. | Zbl 0679.68134
[62] and, On ranking 1-way finitely ambiguous NL languages and #P-complete census functions. RAIRO-Inf. Theor. Appl. 27 (1993) 135-148. | Numdam | Zbl 0780.68082
[63] , and, Counting problems and algebraic formal power series in noncommuting variables. Inf. Process. Lett. 34 (1990) 117-121. | Zbl 0695.68053
[64] ,, and, Parallel algorithms and the classification of problems, in WOPPLOT 86 - Parallel Processing: Logic, Organization, and Technology, edited by J.D. Becker and I. Eisele. Springer, Lect. Notes Comput. Sci. 253 (1986) 206-226. | Zbl 0629.68048
[65] ,, and, Counting techniques for inclusion, equivalence and membership problems. Chapter 5, in The Book of Traces, edited by V. Diekert and G. Rozenberg. World Scientific (1995) 131-164.
[66] , and, Analysis of a class of algorithms for problems on trace languages, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 4th International Conference, AAECC-4, edited by T. Beth and M. Clausen. Springer, Lect. Notes Comput. Sci. 307 (1986) 202-214. | Zbl 0648.68079
[67] , and, Computing the counting function of context-free languages, in STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, edited by F.-J. Brandenburg, G. Vidal-Naquet and M. Wirsing. Lect. Notes Comput. Sci. 247 (1987) 169-179. | Zbl 0634.68069
[68] , and, The complexity of computing the number of strings of given length in context-free languages. Theor. Comput. Sci. 86 (1991) 325-342. | Zbl 0744.68066
[69] , and, Random generation and approximate counting of ambiguously described combinatorial structures, in STACS 2000, edited by H. Reichel and S. Tison. Springer, Lect. Notes Comput. Sci. 1770 (2000) 567-580. | Zbl 0962.68126
[70] , and, Random generation for finitely ambiguous context-free languages. RAIRO-Inf. Theor. Appl. 35 (2001) 499-512. | Numdam | Zbl 1005.68091
[71] ,, and, Compattazione di strutture informative nella descrizione di processi musicali, in Atti del Congresso Annuale AICA. Dedalo (1976) 497-508.
[72] and, On the inclusion problem for finitely ambiguous rational trace languages. RAIRO-Inf. Theor. Appl. 32 (1998) 79-98.
[73] , and, Random generation of words with fixed occurences in regular languages, in WORDS'03, 4th International Conference on Combinatorics on Words. September 2003, Turku, Finland (2003) 332-343. | Zbl 1040.68071
[74] , and, Holonomic generating functions and context free languages. Int. J. Found. Comput. Sci. 3 (1992) 181-191. | Zbl 0754.68064
[75] and, Aspetti algebrico-categoriali di problemi combinatori, in Atti del Congresso Annuale AICA (1975) 387-393.
[76] and, Introduzione alle serie formali, Quaderni di Informatica Teorica, ISEDI 2 (1975). | MR 520386
[77] and, Il linguaggio delle categorie nell'informatica teorica, Quaderni di Informatica Teorica. ISEDI 4 (1977).
[78] and, On efficient computation of the coefficients of some polynomials with applications to some enumeration problems. Inf. Process. Lett. 12 (1981) 142-145. | Zbl 0462.68027
[79] , and, Una guida euristica alla soluzione di problemi combinatori, in Atti del Convegno Complessità di Calcolo, Modelli Gestionali e Territorio, CNR (1977) 130-145.
[80] , and, A characterization of abstract data as model-theoretic invariants, in Automata, Languages and Programming, 6th Colloquium, edited by H.A. Maurer. Springer, Lect. Notes Comput. Sci. 71 (1979) 26-37. | Zbl 0411.68033
[81] , and, Towards a theory of abstract data types: A discussion on problems and tools, in International Symposium on Programming, Proceedings of the Fourth 'Colloque International sur la Programmation', edited by B. Robinet. Springer, Lect. Notes Comput. Sci. 83 (1980) 44-58. | Zbl 0435.68022
[82] , and, On the power of model theory in specifying abstract data types and in capturing their recursiveness. Fundamenta Informaticae 6 (1983) 127-170. | Zbl 0529.68008
[83] , and, Abstract data types and their extensions within a constructive logic, in Semantics of Data Types, International Symposium, edited by G. Kahn, D.B. MacQueen and G.D. Plotkin. Springer, Lect. Notes Comput. Sci. 173 (1984) 177-195. | Zbl 0584.68033
[84] , and, A characterization of the class of functions computable in polynomial time on random access machines, in Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation. ACM (1981) 168-176.
[85] , and, Disegno di programmi guidato dalle strutture di ingresso-uscita: un inquadramento teorico, in Atti Congresso Annuale AICA 2 (1981) 663-669.
[86] , and, Context free trace languages, in CAAP '82 (1982) 32-42. | Zbl 0548.68072
[87] , and, Equivalence and membership problems for regular trace languages, in Automata, Languages and Programming, 9th Colloquium, edited by M. Nielsen and E.M. Schmidt. Springer, Lect. Notes Comput. Sci. 140 (1982) 61-71. | Zbl 0486.68079
[88] , and, Metodologie di disegno di programmi guidate dalle strutture di dati di ingresso-uscita: Analisi formale di una proposta di estensione, in Atti Congresso Annuale AICA. CLEUP 1 (1982) 259-262.
[89] , and, Una classe di problemi vantaggiosamente parallelizzabili, in Atti del Congresso Annuale AICA, Liguori 1 (1983) 375-386.
[90] , and, Simulations among classes of random access machines and equivalence among numbers succintly represented, in Analysis and Design of Algorithms for Combinatorial Problems, edited by G. Ausiello and M. Lucertini. North-Holland (1985) 65-89. | Zbl 0609.68039
[91] , and, Membership problems for regular and context-free trace languages. Inf. Comput. 82 (1989) 135-150. | Zbl 0682.68040
[92] , and, An algebraic approach to problem solution and problem semantics, in Mathematical Foundations of Computer Science 1977, 6th Symposium, edited by J. Gruska. Springer, Lect. Notes Comput. Sci. 53 (1977) 253-262. | Zbl 0365.68056
[93] , and, Some recursive unsolvable problems relating to isolated cutpoints in probabilistic automata, in Automata, Languages and Programming, Fourth Colloquium, edited by A. Salomaa and M. Steinby. Springer, Lect. Notes Comput. Sci. 52 (1977) 87-94. | Zbl 0366.94064
[94] , and, Three efficient algorithms for counting problems. Inf. Process. Lett. 8 (1979) 50-53. | Zbl 0404.68068
[95] , and, Approximating stochastic events by quantum automata, in ERATO International Conference on Quantum Information Science 2003, Kyoto, Japan (2003).
[96] , and, Golomb rulers and difference sets for succinct quantum automata. Int. J. Found. Comput. Sci. 14 (2003) 871-888. | Zbl 1075.68028
[97] , and, Lower bounds on the size of quantum automata accepting unary languages, in Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings, edited by C. Blundo and C. Laneve. Springer, Lect. Notes Comput. Sci. 2841 (2003) 86-96.
[98] , and, Quantum computing: 1-way quantum automata, in Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings, edited by Z. Ésik and Z. Fülöp. Springer, Lect. Notes Comput. Sci. 2710 (2003) 1-20. | Zbl 1037.68058
[99] , and, Small size quantum automata recognizing some regular languages. Theor. Comput. Sci. 340 (2005) 394-407. | Zbl 1087.68047
[100] , and, Some formal methods for analyzing quantum automata, in 7th International Workshop on Descriptional Complexity of Formal Systems (DCFS'05), Como (2005) 1-14.
[101] , and, Corrigendum: An optimal lower bound for nonregular languages. Inf. Process. Lett. 52 (1994) 339. | MR 1307753 | Zbl 0998.68531
[102] , and, On languages accepted with simultaneous complexity bounds and their ranking problem, in Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, edited by I. Prívara, B. Rovan and P. Ruzicka. Springer, Lect. Notes Comput. Sci. 841 (1994) 245-255.
[103] , and, An optimal lower bound for nonregular languages. Inf. Process. Lett. 50 (1994) 289-292. | Zbl 0810.68089
[104] , and, Strong optimal lower bounds for Turing machines that accept nonregular languages, in Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, edited by J. Wiedermann and P. Hájek. Springer, Lect. Notes Comput. Sci. 969 (1995) 309-318.
[105] and, Structural complexity and neural networks, in Neural Nets, 13th Italian Workshop on Neural Nets, WIRN, edited by M. Marinaro and R. Tagliaferri. Springer, Lect. Notes Comput. Sci. 2486 (2002) 190-215. | Zbl 1028.68577
[106] and, Generating functions of trace languages. Bulletin of the EATCS 35 (1988) 106-112. | Zbl 0681.68096
[107] and, Elementi di matematica combinatoria, Serie di informatica. ISEDI 4 (1977). | MR 480046 | Zbl 0393.05001
[108] and, Ensembles based on random projections to improve the accuracy of clustering algorithms, in 16th Italian Workshop on Neural Nets, WIRN, 2005. Springer, Lect. Notes Comput. Sci. 3931 (2006) 31-37.
[109] ,, and, Algebraic and informational aspects of Zielonka's theorem, in Semigroups: Algebraic Theory and Applications to Formal Languages and Codes, edited by C. Tibiletti, C. Bonzini and A. Cherubini. World Scientific (1993) 17-26. | Zbl 0828.20067