Heiko Vogler


Ontology type: schema:Person     


Person Info

NAME

Heiko

SURNAME

Vogler

Publications in SciGraph latest 50 shown

  • 2020-11-06 Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2019-05-24 Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem in ALGEBRAIC INFORMATICS
  • 2018-06-15 Weighted iterated linear control in ACTA INFORMATICA
  • 2016-07-21 Weighted Symbolic Automata with Data Storage in DEVELOPMENTS IN LANGUAGE THEORY
  • 2016-02-26 A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2015-09-09 A Chomsky-Schützenberger Theorem for Weighted Automata with Storage in ALGEBRAIC INFORMATICS
  • 2015-09-09 Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics in ALGEBRAIC INFORMATICS
  • 2015-05-29 Characterizations of recognizable weighted tree languages by logic and bimorphisms in SOFT COMPUTING
  • 2014-03-21 Forward and backward application of symbolic tree transducers in ACTA INFORMATICA
  • 2013 The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages in DEVELOPMENTS IN LANGUAGE THEORY
  • 2012 Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars in DEVELOPMENTS IN LANGUAGE THEORY
  • 2010-10-28 A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids in THEORY OF COMPUTING SYSTEMS
  • 2010 Compositions of Top-Down Tree Transducers with ε-Rules in FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING
  • 2010 Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices in DEVELOPMENTS IN LANGUAGE THEORY
  • 2009-09-16 Weighted Tree Automata and Tree Transducers in HANDBOOK OF WEIGHTED AUTOMATA
  • 2009-06-27 Weighted Logics for Unranked Tree Automata in THEORY OF COMPUTING SYSTEMS
  • 2007-10-24 A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids in THEORY OF COMPUTING SYSTEMS
  • 2004-09-15 A Kleene Theorem for Weighted Tree Automata in THEORY OF COMPUTING SYSTEMS
  • 2000-02 The Universality of Higher-Order Attributed Tree Transducers in THEORY OF COMPUTING SYSTEMS
  • 1999-12 A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers in THEORY OF COMPUTING SYSTEMS
  • 1998 Syntax-Directed Semantics, Formal Models Based on Tree Transducers in NONE
  • 1997 Benefits of Hypergraphs for Program Transformation in INFORMATIK ’97 INFORMATIK ALS INNOVATIONSMOTOR
  • 1997 Attributgrammatiken, Eine grundlegende Einführung in NONE
  • 1994-05 Synthesized and inherited functions in ACTA INFORMATICA
  • 1992-07 An implementation of syntax directed functional programming on nested-stack machines in FORMAL ASPECTS OF COMPUTING
  • 1988-10 High level tree transducers and iterated pushdown tree transducers in ACTA INFORMATICA
  • 1986-12 Iterated linear control and iterated one-turn pushdowns in THEORY OF COMPUTING SYSTEMS
  • 1986 Basic tree transducers in CAAP '86
  • 1986 The OI-hierarchy is closed under control in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1986
  • 1985 Characterization of high level tree transducers in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1985 Iterated linear control and iterated one-turn pushdowns in FUNDAMENTALS OF COMPUTATION THEORY
  • 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": "http://www.grid.ac/institutes/grid.4488.0", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.6582.9", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.1957.a", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.5132.5", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.6214.1", 
            "type": "Organization"
          }
        ], 
        "familyName": "Vogler", 
        "givenName": "Heiko", 
        "id": "sg:person.014562633673.93", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014562633673.93"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-01-01T19:56", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/person/person_659.jsonl", 
        "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.014562633673.93'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...