Quelques propriétés algébriques des automates. - Virgil Emil Cazanescu (Discret. Math., 1972)

On topologies generated by Moisil resemblance relations. - Cristian Calude; Virgil Emil Cazanescu (Discret. Math., 1979)

On Context-Free Trees. - Virgil Emil Cazanescu (Theor. Comput. Sci., 1985)

Iterative Systems of Equations. - Virgil Emil Cazanescu (MFCS, 1986)

A note on axiomatizing flowchart schemes. - Virgil Emil Cazanescu; Gheorghe Stefanescu (Acta Cybern., 1990)

Classes of finite relations as initial abstract data types I. - Virgil Emil Cazanescu; Gheorghe Stefanescu (Discret. Math., 1991)

Initial and Final Congruences. - Virgil Emil Cazanescu; Rodica Ceterchi (Acta Cybern., 1992)

A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization. - Virgil Emil Cazanescu; Gheorghe Stefanescu (Theor. Comput. Sci., 1992)

Local Equational Logic II. - Virgil Emil Cazanescu (Developments in Language Theory, 1993)

Local Equational Logic. - Virgil Emil Cazanescu (FCT, 1993)

Feedback, Iteration, and Repetition. - Virgil Emil Cazanescu; Gheorghe Stefanescu (Mathematical Aspects of Natural and Formal Languages, 1994)

Classes of finite relations as initial abstract data types - II. - Virgil Emil Cazanescu; Gheorghe Stefanescu (Discret. Math., 1994)

The Structure of the Basic Morphisms. - Virgil Emil Cazanescu (New Trends in Formal Languages, 1997)

Weak Inclusion Systems. - Virgil Emil Cazanescu; Grigore Rosu (Math. Struct. Comput. Sci., 1997)

Weak Inclusion Systems: Part Two. - Virgil Emil Cazanescu; Grigore Rosu (J. Univers. Comput. Sci., 2000)

Homomorphic Characterizations of Linear and Algebraic Languages. - Virgil Emil Cazanescu; Manfred Kudlek (Grammars and Automata for String Processing, 2003)

Programming via Rewriting. - Virgil Emil Cazanescu (SYNASC, 2010)