Joost Engelfriet


Ontology type: schema:Person     


Person Info

NAME

Joost

SURNAME

Engelfriet

Publications in SciGraph latest 50 shown

  • 2017-08-16 Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars in FUNDAMENTALS OF COMPUTATION THEORY
  • 2017-02 Composition Closure of Linear Extended Top-down Tree Transducers in THEORY OF COMPUTING SYSTEMS
  • 2016-02 Erratum to: “Top-down Tree Transducers with Regular Look-ahead” in THEORY OF COMPUTING SYSTEMS
  • 2015-11 Two-way pebble transducers for partial functions and their composition in ACTA INFORMATICA
  • 2014 How to Remove the Look-Ahead of Top-Down Tree Transducers in DEVELOPMENTS IN LANGUAGE THEORY
  • 2013 Determinacy and Rewriting of Top-Down and MSO Tree Transformations in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013
  • 2009-12 Extended multi bottom–up tree transducers in ACTA INFORMATICA
  • 2009-04 The time complexity of typechecking tree-walking tree transducers in ACTA INFORMATICA
  • 2008 Extended Multi Bottom-Up Tree Transducers in DEVELOPMENTS IN LANGUAGE THEORY
  • 2006-07 Clique-Width for 4-Vertex Forbidden Subgraphs in THEORY OF COMPUTING SYSTEMS
  • 2006 Nested Pebbles and Transitive Closure in STACS 2006
  • 2005-06-07 Characterization of high level tree transducers in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2005 The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable in FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 2005 Clique-Width for Four-Vertex Forbidden Subgraphs in FUNDAMENTALS OF COMPUTATION THEORY
  • 2004-05 A new natural structural congruence in the pi-calculus with replication in ACTA INFORMATICA
  • 2004 Pushdown Automata in FORMAL LANGUAGES AND APPLICATIONS
  • 2003-08 A comparison of pebble tree transducers with macro tree transducers in ACTA INFORMATICA
  • 2003-06-18 Branching Grammars: A Generalization of ET0L Systems in DEVELOPMENTS IN LANGUAGE THEORY
  • 2002-10-04 Two-Way Finite State Transducers with Nested Pebbles in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002
  • 2002-01-18 Two-way finite state transducers and monadic second-order logic in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002 Hierarchies of String Languages Generated by Deterministic Tree Transducers in DEVELOPMENTS IN LANGUAGE THEORY
  • 2002 The Delta Operation: From Strings to Trees to Strings in FORMAL AND NATURAL COMPUTING
  • 2000 Characterizing and Deciding MSO-Definability of Macro Tree Transductions in STACS 2000
  • 2000 Tree Languages Generated by Context-Free Graph Grammars in THEORY AND APPLICATION OF GRAPH TRANSFORMATIONS
  • 1999 Tree-Walking Pebble Automata in JEWELS ARE FOREVER
  • 1998-12 Axioms for generalized graphs, illustrated by a Cantor–Bernstein proposition in ACTA INFORMATICA
  • 1998 Elementary net systems in LECTURES ON PETRI NETS I: BASIC MODELS
  • 1997-09 Context-free graph grammars and concatenation of graphs in ACTA INFORMATICA
  • 1997 Context-Free Graph Grammars in HANDBOOK OF FORMAL LANGUAGES
  • 1997 Monadic second order logic and node relations on graphs and trees in STRUCTURES IN LOGIC AND COMPUTER SCIENCE
  • 1996 Concatenation of graphs in GRAPH GRAMMARS AND THEIR APPLICATION TO COMPUTER SCIENCE
  • 1995-11 A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement grammars in MATHEMATICAL SYSTEMS THEORY
  • 1995 Domino treewidth in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1994-04 Context-free graph languages of bounded degree are generated by apex graph grammars in ACTA INFORMATICA
  • 1994 Graph grammars and tree transducers in TREES IN ALGEBRA AND PROGRAMMING — CAAP'94
  • 1994 Deciding the NTS property of context-free grammars in RESULTS AND TRENDS IN THEORETICAL COMPUTER SCIENCE
  • 1993 A multiset semantics for the pi-calculus with replication in CONCUR'93
  • 1992-02 Context-free hypergraph grammars have the same term-generating power as attribute grammars in ACTA INFORMATICA
  • 1992 A Greibach normal form for context-free graph grammars in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1991-06 Branching processes of Petri nets in ACTA INFORMATICA
  • 1991 Graph grammars based on node rewriting: an introduction to NLC graph grammars in GRAPH GRAMMARS AND THEIR APPLICATION TO COMPUTER SCIENCE
  • 1991 A characterization of context-free NCE graph languages by monadic second-order logic on trees in GRAPH GRAMMARS AND THEIR APPLICATION TO COMPUTER SCIENCE
  • 1991 Net-based description of parallel object-based systems, or POTs and POPs in FOUNDATIONS OF OBJECT-ORIENTED LANGUAGES
  • 1991 Context-free handle-rewriting hypergraph grammars in GRAPH GRAMMARS AND THEIR APPLICATION TO COMPUTER SCIENCE
  • 1991 The term generating power of context-free hypergraph grammars in GRAPH GRAMMARS AND THEIR APPLICATION TO COMPUTER SCIENCE
  • 1990-05 Attribute storage optimization by stacks in ACTA INFORMATICA
  • 1990 Formalizing the Behaviour of Parallel Object-Based Systems by Petri Nets in SEMANTICS FOR CONCURRENCY
  • 1989 Context-free NCE graph grammars in FUNDAMENTALS OF COMPUTATION THEORY
  • 1989 Automata with storage on infinite words in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1988-10 High level tree transducers and iterated pushdown tree transducers in ACTA INFORMATICA
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "familyName": "Engelfriet", 
        "givenName": "Joost", 
        "id": "sg:person.014574236321.39", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014574236321.39"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:57", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1727.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.014574236321.39'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.014574236321.39'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.014574236321.39'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.014574236321.39'


     

    This table displays all metadata directly associated to this object as RDF triples.

    11 TRIPLES      9 PREDICATES      10 URIs      6 LITERALS      1 BLANK NODES

    Subject Predicate Object
    1 sg:person.014574236321.39 schema:familyName Engelfriet
    2 schema:givenName Joost
    3 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014574236321.39
    4 schema:sdDatePublished 2019-03-07T13:57
    5 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    6 schema:sdPublisher N529abd97386d47219cbdd8b006cb8e4b
    7 sgo:license sg:explorer/license/
    8 sgo:sdDataset persons
    9 rdf:type schema:Person
    10 N529abd97386d47219cbdd8b006cb8e4b schema:name Springer Nature - SN SciGraph project
    11 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...