( en | de | ru )

 

Disambiguation of "Engelfriet, Joost"

Author of the publication

copydeleteadd this publication to your clipboard
Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages

, and . FOCS, page 123-126. IEEE Computer Society, (1978)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Holger Joost

Joost Wintterlin

Petra Joost

Joost Krüger

Karsten Joost

 

Other publications of authors with the same name

Regular Characterizations of Macro Tree Transducers., and . CAAP, page 103-118. Cambridge University Press, (1984)Context-Free Graph Grammars.. Handbook of Formal Languages (3), Springer, (1997)Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity., , and . CoRR, (2019)Apex Graph Grammars., , and . Graph-Grammars and Their Application to Computer Science, volume 291 of Lecture Notes in Computer Science, page 167-185. Springer, (1986)Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs., , and . REX Workshop, volume 489 of Lecture Notes in Computer Science, page 229-273. Springer, (1990)Context-Free NCE Graph Grammars.. FCT, volume 380 of Lecture Notes in Computer Science, page 148-161. Springer, (1989)Corrigendum to "Iterated stack automata and complexity classes" Inf. Comput. 95 (1) (1991) 21-75.. Inf. Comput., (2019)Iterated Pushdown Automata and Complexity Classes. STOC, page 365-373. ACM, (1983)Finitary Compositions of Two-way Finite-State Transductions., and . Fundam. Informaticae, 80 (1-3): 111-123 (2007)A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage., and . Discret. Math. Theor. Comput. Sci., (2020)