Hendrik Jan Hoogeboom

Ontology type: schema:Person     

Person Info


Hendrik Jan



Publications in SciGraph latest 50 shown

  • 2017 Finite Language Forbidding-Enforcing Systems in UNVEILING DYNAMICS AND COMPLEXITY
  • 2014 The Algebra of Gene Assembly in Ciliates in DISCRETE AND TOPOLOGICAL MODELS IN MOLECULAR BIOLOGY
  • 2014 Graph Polynomials Motivated by Gene Rearrangements in Ciliates in LANGUAGE, LIFE, LIMITS
  • 2012 Asynchronous Extended Spiking Neural P Systems with Astrocytes in MEMBRANE COMPUTING
  • 2011-03 On aggregation in multiset-based self-assembly of graphs in NATURAL COMPUTING
  • 2010 Pivot and Loop Complementation on Graphs and Set Systems in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2010 Spiking Neural P Systems with Neuron Division in MEMBRANE COMPUTING
  • 2009 Reality-and-Desire in Ciliates in ALGORITHMIC BIOPROCESSES
  • 2008-07 The fibers and range of reduction graphs in ciliates in ACTA INFORMATICA
  • 2008 Extending the Overlap Graph for Gene Assembly in Ciliates in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2007 High Spies (or How to Win a Programming Contest) in FUN WITH ALGORITHMS
  • 2007 From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates in FUNDAMENTALS OF COMPUTATION THEORY
  • 2007 Characterizing Reduction Graphs for Gene Assembly in Ciliates in DEVELOPMENTS IN LANGUAGE THEORY
  • 2006-05 The Construction of Minimal DNA Expressions in NATURAL COMPUTING
  • 2006 Applicability of Loop Recombination in Ciliates Using the Breakpoint Graph in COMPUTATIONAL LIFE SCIENCES II
  • 2006 Nested Pebbles and Transitive Closure in STACS 2006
  • 2006 Computing by Only Observing in DEVELOPMENTS IN LANGUAGE THEORY
  • 2005 Combinatorial Aspects of Minimal DNA Expressions in DNA COMPUTING
  • 2005 The Breakpoint Graph in Ciliates in COMPUTATIONAL LIFE SCIENCES
  • 2004-12 P systems with symport/antiport simulating counter automata in ACTA INFORMATICA
  • 2003-06-24 Carriers and Counters in DEVELOPMENTS IN LANGUAGE THEORY
  • 2003 Simulating Counter Automata by P Systems with Symport/Antiport in MEMBRANE COMPUTING
  • 2003 Languages Defined by Generalized Equality Sets in FUNDAMENTALS OF COMPUTATION THEORY
  • 2002-01-18 Two-way finite state transducers and monadic second-order logic in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002 Context-Free Valence Grammars - Revisited in DEVELOPMENTS IN LANGUAGE THEORY
  • 2002 Upper Bounds for Restricted Splicing in FORMAL AND NATURAL COMPUTING
  • 2001-04 Sequences of languages in forbidding–enforcing families in SOFT COMPUTING
  • 2001 A Characterization of Non-Iterated Splicing with Regular Rules in WHERE MATHEMATICS, COMPUTER SCIENCE, LINGUISTICS AND BIOLOGY MEET
  • 2000-11 Fair sticker languages in ACTA INFORMATICA
  • 1999 Tree-Walking Pebble Automata in JEWELS ARE FOREVER
  • 1997-08 Monadic second-order definable text languages in THEORY OF COMPUTING SYSTEMS
  • 1994 MSO definable text languages in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1994
  • 1994 Identities and transductions in RESULTS AND TRENDS IN THEORETICAL COMPUTER SCIENCE
  • 1989-12 Characterizations of the decidability of some problems for regular trace languages in MATHEMATICAL SYSTEMS THEORY
  • 1989 Automata with storage on infinite words in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1988-02 Recording the use of memory in right-boundary grammars and push-down automata in ACTA INFORMATICA
  • 1987 Decision problems for regular trace languages in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1986 Infinitary languages: Basic theory and applications to concurrent systems in CURRENT TRENDS IN CONCURRENCY
  • 1985 On coordinated rewriting in FUNDAMENTALS OF COMPUTATION THEORY
  • Affiliations

  • Leiden University (current)
  • 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", 
        "affiliation": [
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.5132.5", 
              "type": "Organization"
            "isCurrent": true, 
            "type": "OrganizationRole"
        "familyName": "Hoogeboom", 
        "givenName": "Hendrik Jan", 
        "id": "sg:person.013762305654.52", 
        "identifier": {
          "name": "orcid_id", 
          "type": "PropertyValue", 
          "value": [
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:10", 
        "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_1935.json", 
        "type": "Person"

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


    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.013762305654.52'

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

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

    Turtle is a human-readable linked data format.

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

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

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


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