( 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.

Joost Krüger

Holger Joost

Joost Wintterlin

Petra Joost

Karsten Joost

 

Other publications of authors with the same name

Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity., , and . CoRR, (2019)MSO definable string transductions and two-way finite state transducers, and . CoRR, (1999)Macro Tree Translations of Linear Size Increase are MSO Definable., and . SIAM J. Comput., 32 (4): 950-1006 (2003)Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars., , and . Acta Inf., 31 (4): 341-378 (1994)Attribute Storage Optimization by Stacks., and . Acta Inf., 27 (6): 567-581 (1990)Regular Characterizations of Macro Tree Transducers., and . CAAP, page 103-118. Cambridge University Press, (1984)Iterated Pushdown Automata and Complexity Classes. STOC, page 365-373. ACM, (1983)Complexity of boundary graph languages., and . RAIRO Theor. Informatics Appl., (1990)Context-free Handle-rewriting Hypergraph Grammars., , and . Graph-Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, page 253-268. Springer, (1990)The Term Generating Power of Context-Free Hypergraph Grammars., and . Graph-Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, page 328-243. Springer, (1990)