| |
| 2003 | ||
|---|---|---|
| 13 | Virgil Emil Cazanescu, Manfred Kudlek: Homomorphic Characterizations of Linear and Algebraic Languages. Grammars and Automata for String Processing 2003: 215-224 | |
| 2000 | ||
| 12 | EE | Virgil Emil Cazanescu, Grigore Rosu: Weak Inclusion Systems: Part Two. J. UCS 6(1): 5-21 (2000) |
| 1997 | ||
| 11 | Virgil Emil Cazanescu: The Structure of the Basic Morphisms. New Trends in Formal Languages 1997: 422-429 | |
| 10 | Virgil Emil Cazanescu, Grigore Rosu: Weak Inclusion Systems. Mathematical Structures in Computer Science 7(2): 195-206 (1997) | |
| 1994 | ||
| 9 | EE | Virgil Emil Cazanescu, Gheorghe Stefanescu: Classes of finite relations as initial abstract data types - II. Discrete Mathematics 126(1-3): 47-65 (1994) |
| 1993 | ||
| 8 | Virgil Emil Cazanescu: Local Equational Logic II. Developments in Language Theory 1993: 210-221 | |
| 7 | Virgil Emil Cazanescu: Local Equational Logic. FCT 1993: 162-170 | |
| 1992 | ||
| 6 | EE | Virgil Emil Cazanescu, Rodica Ceterchi: Initial and Final Congruences. Acta Cybern. 10(3): 199-216 (1992) |
| 5 | Virgil Emil Cazanescu, Gheorghe Stefanescu: A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization. Theor. Comput. Sci. 99(1): 1-63 (1992) | |
| 1991 | ||
| 4 | EE | Virgil Emil Cazanescu, Gheorghe Stefanescu: Classes of finite relations as initial abstract data types I. Discrete Mathematics 90(3): 233-265 (1991) |
| 1990 | ||
| 3 | Virgil Emil Cazanescu, Gheorghe Stefanescu: A note on axiomatizing flowchart schemes. Acta Cybern. 9(4): 349-359 (1990) | |
| 1986 | ||
| 2 | Virgil Emil Cazanescu: Iterative Systems of Equations. MFCS 1986: 239-246 | |
| 1985 | ||
| 1 | Virgil Emil Cazanescu: On Context-Free Trees. Theor. Comput. Sci. 41: 33-50 (1985) | |
| 1 | Rodica Ceterchi | [6] |
| 2 | Manfred Kudlek | [13] |
| 3 | Grigore Rosu | [10] [12] |
| 4 | Gheorghe Stefanescu | [3] [4] [5] [9] |