R. Verraedt

According to our database1, R. Verraedt authored at least 23 papers between 1980 and 1985.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1985
A Combinatorial Property of EOL Languages.
Math. Syst. Theory, 1985

On erasing in EOL forms.
Discret. Appl. Math., 1985

1984
On Simulation and Propagating E0L Forms.
Theor. Comput. Sci., 1984

On Inherently Ambiguous E0L Languages.
Theor. Comput. Sci., 1984

1983
Subset Languages of Petri Nets Part II: Closure Properties.
Theor. Comput. Sci., 1983

Subset Languages of Petri Nets Part I: The Relationship to String Languages and Normal Forms.
Theor. Comput. Sci., 1983

The goodness of {S, a}-EOL forms is decidable.
Discret. Appl. Math., 1983

On sequential and parallel node-rewriting graph grammars, II.
Comput. Vis. Graph. Image Process., 1983

1982
Studies in uniformity.
Inf. Sci., 1982

A note on the similarity depth.
Discret. Appl. Math., 1982

Basic formulas and languages: PART II.Applications to E0L systems and forms.
Discret. Appl. Math., 1982

On sequential and parallel node-rewriting graph grammars, II.
Comput. Graph. Image Process., 1982

On sequential and parallel node-rewriting graph grammars.
Comput. Graph. Image Process., 1982

On the role of blocking in rewriting systems.
Acta Cybern., 1982

Completeness of <i> E </i> 0 <i> L </i> Forms is Decidable.
Acta Informatica, 1982

Subset Languages of Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 1982

1981
On Fixed, Terminal Fixed and Nonterminal Fixed Interpretations of EOL Forms
Inf. Control., February, 1981

On Pure, Terminal Invariant and Nonterminal Invariant Interpretations of E0L Forms.
Theor. Comput. Sci., 1981

Recursion and pumping in L Forms.
Inf. Sci., 1981

Basic formulas and languages Part I. The theory.
Discret. Appl. Math., 1981

1980
Synchronized, Desynchronized and Coordinated EOL Systems
Inf. Control., August, 1980

Synchronized and desynchronized E0L forms.
Discret. Appl. Math., 1980

Many-to-one simulation in E0L forms is decidable.
Discret. Appl. Math., 1980


  Loading...