Andreas Maletti


Ontology type: schema:Person     


Person Info

NAME

Andreas

SURNAME

Maletti

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 Compositions of Tree-to-Tree Statistical Machine Translation Models in DEVELOPMENTS IN LANGUAGE THEORY
  • 2013 Synchronous Forest Substitution Grammars in ALGEBRAIC INFORMATICS
  • 2013 Hyper-optimization for Deterministic Tree Automata in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2013 Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers in DEVELOPMENTS IN LANGUAGE THEORY
  • 2012 Hyper-minimization for Deterministic Tree Automata in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2012 Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars in DEVELOPMENTS IN LANGUAGE THEORY
  • 2011-05 MAT learners for tree series: an abstract data type and two realizations in ACTA INFORMATICA
  • 2011 Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition in ALGEBRAIC FOUNDATIONS IN COMPUTER SCIENCE
  • 2011 Pushing for Weighted Tree Automata in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011
  • 2011 Tree Transformations and Dependencies in THE MATHEMATICS OF LANGUAGE
  • 2011 Simulations of Weighted Tree Automata in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2011 Computing All ℓ-Cover Automata Fast in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2011 On Minimising Automata with Errors in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011
  • 2011 Better Hyper-minimization in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2010 Input Products for Weighted Extended Top-Down Tree Transducers in DEVELOPMENTS IN LANGUAGE THEORY
  • 2010 Minimizing Weighted Tree Grammars Using Simulation in FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING
  • 2010 Compositions of Top-Down Tree Transducers with ε-Rules in FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING
  • 2009-12 Extended multi bottom–up tree transducers in ACTA INFORMATICA
  • 2009-04 A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids in THEORY OF COMPUTING SYSTEMS
  • 2009 An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2009 A Backward and a Forward Simulation for Weighted Tree Automata in ALGEBRAIC INFORMATICS
  • 2009 Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited in ALGEBRAIC INFORMATICS
  • 2008 Minimizing Deterministic Weighted Tree Automata in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2008 Extended Multi Bottom-Up Tree Transducers in DEVELOPMENTS IN LANGUAGE THEORY
  • 2008 Tree-Series-to-Tree-Series Transformations in IMPLEMENTATION AND APPLICATIONS OF AUTOMATA
  • 2008 Myhill-Nerode Theorem for Recognizable Tree Series Revisited in LATIN 2008: THEORETICAL INFORMATICS
  • 2007 Backward and Forward Bisimulation Minimisation of Tree Automata in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2007 Bisimulation Minimisation for Weighted Tree Automata in DEVELOPMENTS IN LANGUAGE THEORY
  • 2006 Does o-Substitution Preserve Recognizability? in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2006 The Substitution Vanishes in ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY
  • 2005 The Power of Tree Series Transducers of Type I and II in DEVELOPMENTS IN LANGUAGE THEORY
  • 2005 Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2004 Relating Tree Series Transducers and Weighted Tree Automata in DEVELOPMENTS IN LANGUAGE 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": "https://www.grid.ac/institutes/grid.9647.c", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.4488.0", 
            "type": "Organization"
          }
        ], 
        "familyName": "Maletti", 
        "givenName": "Andreas", 
        "id": "sg:person.016645332751.01", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016645332751.01"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:41", 
        "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_1465.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.016645332751.01'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...