|
|
Prof.dr. Cazanescu Emil - sef catedra
|
|
Data si locul nasterii: 9 septembrie 1943, Bucuresti.
Educatia: Absolvent in 1966, Facultatea de Matematica, Universitatea Bucuresti.
Teza de doctorat: 1976, "Categorii de algebre universale", cond.st. Grigore C.Moisil si Sergiu Rudeanu.
Pozitii academice: Preparator: 1967-1970; Asistent: 1970-1978; Lector: 1978-1990; Conferentiar: 1990-1992; Profesor: din 1992.
Cursuri predate: Introducere in Programare, Limbaje de Programare, Tehnici de Programare, Structuri de date si algoritmi, Teoria algoritmilor, Teoria functiilor recursive, Programare in Assembler, Arhitectura Calculatoarelor, Matematica Discreta, Algebra pentru Informatica, Limbaje Formale si Automate, Teoria Limbajelor de Programare, Teoria Automatelor, Logica Matematica, Inteligenta Artificiala, Programare Functionala, Teoria Modelelor, Informatica algebrica, Informatica teoretica, Metode topologice in informatica, Metode categoriale in informatica, Logica pentru informatica, Teoria modelelor abstracte pentru informatica, Scheme de programe, Programare declarativa.
Domenii de interes stiintific: Informatica algebrica: Teoria demonstratiei, Algebra retelelor, etc.
A infiintat in 1993 la Facultatea de Matematica a Universitatii Bucuresti catedra de Fundamentele Informaticii, pe care a condus-o pana in anul 2000. In 2004 a fost reales sef de catedra.
Conducator de doctorat la Universitatea Bucuresti din 1994.
Membru in Comitetele de redactie la: Romanian Journal of Information Science and Technology; Analele Universitatii Bucuresti.
Membru al organizatiilor profesionale: AMS, SSMR, SMR.
Recenzent la: Mathematical Reviews.
In liceu a castigat de doua ori olimpiada nationala de matematica.
Pagina Web personala
Carti si manuale
- Introducere in teoria limbajelor formale, Editura Academiei, 1983, 166 pag.
- Logica matematica si teoria multimilor, (cu M.Becheanu, C.Nastasescu si S.Rudeanu), Editura Didactica si Pedagogica, 1973, 156 pag.
- Curs de bazele informaticii (3 fascicole), Tipografia Universitatii Bucuresti, 1974/75, 23+20+18 = 61 pag.
- Curs de bazele informaticii: Limbaje rationale si automate, Tipografia Universitatii Bucuresti, a) editia I, 1975, 34 pag. b) editia II, 1976, 61 pag.
- Curs de bazele informaticii: Partea I, Tipografia Universitatii Bucuresti, 1976, 76 pag.
- Curs de scheme de programe: Latici continue, Tipografia Universitatii Bucuresti, 1980, 121 pag.
- Curs de scheme de programe: Ecuatii recursive cu domenii, Tipografia Universitatii Bucuresti, 1981, 57 pag.
- Curs de bazele informaticii: Introducere in logica matematica, Tipografia Universitatii Bucuresti, 1981, 71 pag.
- Curs de bazele informaticii: Volumul I, Tipografia Universitatii Bucuresti, 1983, 144 pag.
- Curs de bazele informaticii: Volumul II, Tipografia Universitatii Bucuresti, 1983, 175 pag.
- Bazele informaticii: Lectii de logica matematica, (cu C.Calude) Tipografia Universitatii Bucuresti, 1984, 94 pag.
Articole stiintifice
- Despre categoria automatelor secventiale abstracte, An. Univ. Bucuresti Mat. 16(1967), 1, 31-37
- Despre categoria cvasimasinilor, Stud. Cerc. Mat. 20(1968), 5, 669-681
- Les notions fondamentales de la théorie des catégories pour la catégorie des automates séquentiels abstraits et la catégorie des quasimachines, Bull. Math. Soc. Sci. Math. R.S. Roumanie (N.S.) 12(1968), 2, 17-22
- Sur la catégorie des théories déductives, in "Logique automatique informatique", Editura Academiei Bucuresti, 1971, 11-21
- Remarques sur les théories déductives, in "Logique automatique informatique", Editura Academiei Bucuresti, 1971, 23-29
- Quelques propriétés algébriques des automates, Discrete Math. 2(1972), 2, 97-109
- Familles initiales et finales, Rev. Roumaine Math. Pures Appl. 17(1972), 6, 829-836
- Catégories a images et coïmages, Rev. Roumaine Math. Pures Appl. 18(1973), 8, 1171-1193
- Propriétés catégorielles dans la théorie des algèbres universelles, Séminaire Dubreil 27(1973/74), 13, 1-8
- Catégories d'algèbres universelles I, Mathematica (Cluj) 20(1978), 1, 5-20
- Catégories d'algèbres universelles II, Mathematica (Cluj) 20(1978), 2, 133-141
- Independent sets and kernel in graphs and hypergraphs (cu S.Rudeanu), Ann. Fac. Sci. Univ. Nat. Zaire (Kinshasa) Sect. Math.-Phys. 4(1978), 1, 37-66
- Parties algébriques d'un monoide, Rev. Roumaine Math. Pures Appl. 23(1978), 1, 23-28
- On topologies generated by Moisil resemblance relations (cu C.Calude), Discrete Math. 25(1979), 109-115
- On the uniqueness of the solution of a system of context-free equations, An. Univ. Bucuresti Mat. 29(1980), 15-20
- Gramatici algebrice peste un monoid, Stud. Cerc. Mat. 32(1980), 4, 355-370
- Forme normale ale gramaticilor algebrice peste un monoid, Stud. Cerc. Mat. 33(1981), 1, 41-57
- Again on Advice on structuring compilers and proving them correct (cu C.Ungureanu), Preprint Series in Mathematics No. 75/1982, INCREST Bucuresti
- Despre categoria algebrelor ordonate (cu Gh.Stefanescu), Stud. Cerc. Mat. 34(1982), 3, 235-252
- Structura algebrica libera a schemelor logice (cu C.Ungureanu), in INFO-IASI'83, 12-19
- Asupra definitiei S -schemelor logice (cu S.Grama), in INFO- IASI'83, 20-29
- Categorii S-sortate cu suma, in INFO- IASI'83, 242-247
- On context-free trees, Preprint Series in Mathemateics No. 56/1984, INCREST Bucuresti
- On the definition of M-flowcharts (cu S.Grama), Preprint Series in Mathematics No.56/1984, INCREST Bucuresti
- Unele idei privind corectitudinea compilatoarelor (cu C.Ungureanu), Stud. Cerc. Mat. 37(1985), 2, 151-157
- Iterative Systems of equations, Preprint Series in Mathematics No. 41/1985, INCREST Bucuresti
- Partial Flowcharts, Preprint Series in Mathematics No. 42/1985, INCREST Bucuresti
- Infinite Flowcharts, Preprint Series in Mathematics No. 42/1985, INCREST Bucuresti
- Rational Flowcharts, Preprint Series in Mathematics No. 42/1985, INCREST Bucuresti
- Rezolvarea sistemelor prin metoda punctului fix, in INFO-IASI'85, 99-107
- On context-free trees, Theoret. Comput. Sci. 41(1985), 33-50
- The leftmost derivations of a rewriting system form a free algebraic structure, Rev. Roumaine Math. Pures Appl. 31(1986), 1-8
- Iterative systems of equations, in "Lecture Notes in Computer Science" 233(1986), Springer Verlag, 239-246
- Unele proprietati ale teoriilor algebrice punctate (cu Gh.Stefanescu), Stud. Cerc. Mat. 39(1987), 2, 107-115
- A formal representation of flowchart schemes (cu Gh.Stefanescu), Preprint Series in Mathematics No.22/1987, INCREST Bucuresti
- A calculus for flowchart schemes (cu Gh.Stefanescu), in "ABSTRACTS, 8 International Congress of Logic Methodology and Philisophy of Science (LMPS'87), I(1987), Nauka Moskow, 124-127
- Relatii finite ca tipuri abstracte initiale de date (cu Gh. Stefanescu), in INFO-IASI'87, 153-163
- Spre o noua fundamentare algebrica a teoriei schemelor de programe (cu Gh.Stefanescu), in INFO-IASI'87, 164-174
- Un calcul pentru scheme de programe (cu Gh.Stefanescu), in Lucrarile stiintifice ale C.C.U.B. (1987), Tipografia Universitatii Bucuresti, 36-41
- Towards a new algebraic foundation of flowchart scheme theory (cu Gh.Stefanescu), Preprint Series in Mathematics No. 43/1987, INCREST Bucuresti
- On some symmetric strict monoidal categories (cu Gh.Stefanescu), Preprint Series in Mathematics No.43/1987, INCREST Bucuresti
- On the definition of M-flowcharts (cu S.Grama), An. Stiint. Univ. "Al.I. Cuza" Iasi Sect. I-a Mat. (N.S.), 33(1987), 4, 311-320
- On the algebraic theories with iteration, Rev. Roumaine Math. Pures Appl. 33(1988), 7, 561-573
- A formal representation of flowchart schemes (cu Gh.Stefanescu), An. Univ. Bucuresti Mat.-Inf. 37(1988), 2, 33-51
- Feedback, iteration and repetition (cu Gh.Stefanescu), Preprint Series in Mathematics No. 42/1988, INCREST Bucuresti
- A formal representation of flowchart schemes II (cu Gh.Stefanescu), Preprint Series in Mathematics No. 60/1988, INCREST Bucuresti
- On some symmetric strict monoidal categories (cu Gh.Stefanescu), in "East European Category Seminar'88", Eds. Y.Velinov si L.Milev, Predela Bulgaria, 11-12
- Classes of finite relations as initial abstract data types (cu Gh.Stefanescu), Preprint Series in Mathematics No. 3/1989, INCREST Bucuresti
- Classes of finite relations as initial abstract data types (cu Gh.Stefanescu), Preprint Series in Mathematics No. 34/1989, INCREST Bucuresti
- Classes of finite relations as initial abstract data types (cu Gh.Stefanescu), Preprint Series in Mathematics No. 47/1989, INCREST Bucuresti
- Partial flowchart schemes (cu G.A.Mihaila), Preprint Series in Mathematics No. 4/1989, INCREST Bucuresti
- The free algebraic structure of flowcharts (cu C.Ungureanu), Rev. Roumaine Math. Pures Appl. 34(1989), 4, 281-302
- An axiom system for biflow using summation, (extended) feedbackation and identities (cu Gh.Stefanescu), Preprint Series in Mathematics No. 19/1989, INCREST Bucuresti
- A formal representation of flowchart schemes II (cu Gh.Stefanescu), Stud. Cerc. Mat. 41(1989), 3, 151-167
- Iterative systems of equations, An. Univ. Bucuresti Mat.-Inf. 38(1989), 2, 31-45
- Feedback, iteration and repetition (cu Gh.Stefanescu), INF0- IASI'89, 60-69
- An axiom system for biflow using summation, (extended) feedbackation and identities (cu Gh.Stefanescu), INFO-IASI'89, 70-79
- Towards a new algebraic foundation of flowchart scheme theory (cu Gh.Stefanescu), Fund. Inform. 13(1990), 171-210
- A general result on abstract flowchart schemes with application to the study of accessibility, reduction and minimization (cu Gh.Stefanescu), Preprint Series in Mathematics No. 7/1990, INCREST Bucuresti
- Tree models for reduced and minimal flowchart schemes (cu Gh.Stefanescu), Preprint Series in Mathematics No. 8/1990, INCREST Bucuresti
- A note on axiomatizing flowchart schemes (cu Gh.Stefanescu), Acta Cybernet. 9(1990), 4, 349-359
- Spre o fundamentare algebrica a teoriei schemelor de programe (cu Gh.Stefanescu), in Problemele actuale ale cercetarii matematice I, 1990, Tipografia Universitatii Bucuresti, 203-224
- Scalar vectorial operations in strict monoidal categories (cu A.Baranga), An. Univ. Bucuresti Mat.-Inf. 39-40(1990/91), 3, 23-34
- Classes of finite relations as initial abstract data types I (cu Gh.Stefanescu), Discrete Math. 90(1991), 233-265
- Partial flowchart schemes (cu G.A.Mihaila), Stud. Cerc. Mat. 43(1991), 1-2, 11-23
- A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization (cu Gh.Stefanescu), Theoret. Comput. Sci. 99(1992), 1-63
- Initial and final congruences (cu R.Ceterchi), Acta Cybernet. 10(1992), 3, 199-215
- Infinite flowchart schemes (cu G.A.Mihaila), An. Univ. Bucuresti Mat. 41(1992), 2, 35-45
- Flow algebras (cu A.Baranga si Gh.Stefanescu), An. Univ. Bucuresti Mat. 41(1992), 2, 21-34
- Local equational logic, in "Fundamentals of Computation Theory" (Ed. Z.Éqsik), Lecture Notes in Computer Science 710(1993), 162-170
- Stapanirea complexitatii schemelor de programe prin metode algebrice (cu Gh.Stefanescu) in "Stapanirea complexitatii" (ed. C. Calude), Editura Academiei, Bucuresti, 1993, 58-132.
- Local equational logic II, in "Developments in Language Theory" (Eds. G. Rozenberg si A. Salomaa), World Scientific, 1994, 210-221
- Classes of finite relations as initial abstract data types II (cu Gh.Stefanescu), Discrete Math. 126(1994), 47-65
- Feedback, iteration and repetition (cu Gh.Stefanescu) in "Mathematical aspects of natural and formal languages"(Ed. Gh. Paun), World Scientific Series in Computer Science, Vol 43 (1994), 43-62
- The structure of the basic morphisms, in New Trends in Formal Languages (Eds. Gh.Paun si A.Salomaa), Lecture Notes in Comput. Sci. 1218, Springer, 1997, 422-429
- Feedback for Relations, CDMTCS-066 Research Report Series, Auckland, New Zealand, 1997
- Weak inclusion systems (cu G.Rosu) Math. Struct. in Comput. Science 7(1997), 195-206
- Local and Inclusive Logic, Proceedings of the CafeOBJ Symposium '98, Numazu, Japonia, 26-29 Aprilie 1998.
- Weak inclusion systems, Part Two (cu G.Rosu), Journal of Universal Computer Science 6(2000), 1, 5-21
- Algebraic theories, Multiple-Valued Logic, 6(2001), 27-45
- Homomorphic characterizations of linear and algebraic languages, (cu M.Kudlek), (Eds C.Martin-Vide and V.Mitrana) Grammars and Automata for String Processing: From Mathematics and Computer science to Biology and Back, Topics in Computer Mathematics 9, Taylor and Francis, London, 2002, 215-224
- Local Rewriting (cu M.Kudlek), Romanian Journal of Information Science and Technology 6(2003), 105-120
- Foundation of the Rewriting in an Algebra, Romanian Journal of Information Science and Technology 10(2007), 301-400
- Completeness of Paramodulation withouth lifting lemma (va aparea)
Actualizat: 4 noiembrie 2009
|