Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

R. Verraedt

dblp:36/880 · DBLP profile ↗
← Back
21ranked-venue papers
0as first author
0since 2021 · last 1985
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 16Graphics, computer vision, multimedia, augmented reality and games · 3Databases, data management, data science and information retrieval · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Automata and formal languages · 100%
Software engineering, system software, and programming languages
1 paper
Concurrent programming · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
l systems
0.021981
On Fixed, Terminal Fixed and Nonterminal Fixed Interpretations of EOL Forms · Inf. Control. 1981
Synchronized, Desynchronized and Coordinated EOL Systems · Inf. Control. 1980
Concurrent programming
synchronization
0.011980
Synchronized, Desynchronized and Coordinated EOL Systems · Inf. Control. 1980
YearPublicationVenuePosition
1985 On erasing in EOL forms
Grzegorz Rozenberg, R. Verraedt
Discret. Appl. Math.2
1985 A Combinatorial Property of EOL Languages
Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
Math. Syst. Theory3
1984 On Inherently Ambiguous E0L Languages
Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
Theor. Comput. Sci.3
1984 On Simulation and Propagating E0L Forms
Grzegorz Rozenberg, R. Verraedt
Theor. Comput. Sci.2
1983 On sequential and parallel node-rewriting graph grammars, II
Dirk Janssens, Grzegorz Rozenberg, R. Verraedt
Comput. Vis. Graph. Image Process.3
1983 The goodness of {S, a}-EOL forms is decidable
Grzegorz Rozenberg, R. Verraedt
Discret. Appl. Math.2
1983 Subset Languages of Petri Nets Part I: The Relationship to String Languages and Normal Forms
Grzegorz Rozenberg, R. Verraedt
Theor. Comput. Sci.2
1983 Subset Languages of Petri Nets Part II: Closure Properties
Grzegorz Rozenberg, R. Verraedt
Theor. Comput. Sci.2
1982 Completeness of E 0 L Forms is Decidable
Grzegorz Rozenberg, R. Verraedt
Acta Informatica2
1982 On sequential and parallel node-rewriting graph grammars
Dirk Janssens, Grzegorz Rozenberg, R. Verraedt
Comput. Graph. Image Process.3
1982 On sequential and parallel node-rewriting graph grammars, II
Dirk Janssens, R. Verraedt
Comput. Graph. Image Process.2
1982 Basic formulas and languages: PART II.Applications to E0L systems and forms
Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
Discret. Appl. Math.3
1982 A note on the similarity depth
Grzegorz Rozenberg, R. Verraedt
Discret. Appl. Math.2
1982 Studies in uniformity
Grzegorz Rozenberg, R. Verraedt
Inf. Sci.2
1981 Basic formulas and languages Part I. The theory
Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
Discret. Appl. Math.3
1981 On Fixed, Terminal Fixed and Nonterminal Fixed Interpretations of EOL Forms
Grzegorz Rozenberg, R. Verraedt
Inf. Control.2
1981 Recursion and pumping in L Forms
Grzegorz Rozenberg, R. Verraedt
Inf. Sci.2
1981 On Pure, Terminal Invariant and Nonterminal Invariant Interpretations of E0L Forms
Grzegorz Rozenberg, R. Verraedt
Theor. Comput. Sci.2
1980 Many-to-one simulation in E0L forms is decidable
Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt
Discret. Appl. Math.3
1980 Synchronized and desynchronized E0L forms
Grzegorz Rozenberg, R. Verraedt
Discret. Appl. Math.2
1980 Synchronized, Desynchronized and Coordinated EOL Systems
Grzegorz Rozenberg, R. Verraedt
Inf. Control.2