Alexander Okhotin


Ontology type: schema:Person     


Person Info

NAME

Alexander

SURNAME

Okhotin

Publications in SciGraph latest 50 shown

  • 2022-05-06 Rational Index of Languages with Bounded Dimension of Parse Trees in DEVELOPMENTS IN LANGUAGE THEORY
  • 2021-08-06 The Hardest LL(k) Language in DEVELOPMENTS IN LANGUAGE THEORY
  • 2021-06-17 Input-Driven Pushdown Automata on Well-Nested Infinite Strings in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2021-02-22 On Hardest Languages for One-Dimensional Cellular Automata in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2021-02-22 On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2021 Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2021 State Complexity of Union and Intersection on Graph-Walking Automata in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2020-11-06 Longer Shortest Strings in Two-Way Finite Automata in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2020-11-06 State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2020-06-22 On the Transformation of LL(k)-linear Grammars to LL(1)-linear in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2020-02-25 Cyclic Shift on Multi-component Grammars in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2019-07-10 On the Length of Shortest Strings Accepted by Two-Way Finite Automata in DEVELOPMENTS IN LANGUAGE THEORY
  • 2019-06-26 Graph-Walking Automata: From Whence They Come, and Whither They are Bound in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2019-06-25 State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2019-01-11 On the Expressive Power of GF(2)-Grammars in SOFSEM 2019: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2018-08-05 Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata in DEVELOPMENTS IN LANGUAGE THEORY
  • 2018-08-05 A Tale of Conjunctive Grammars in DEVELOPMENTS IN LANGUAGE THEORY
  • 2018-07-11 Further Closure Properties of Input-Driven Pushdown Automata in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2018-07-11 State Complexity of Unambiguous Operations on Deterministic Finite Automata in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2018-03-08 Underlying Principles and Recurring Ideas of Formal Grammars in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2018-03-08 Formal Languages over GF(2) in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2017-06-03 The Quotient Operation on Input-Driven Pushdown Automata in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2017-05-06 Edit Distance Neighbourhoods of Input-Driven Pushdown Automata in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2016-11-01 Approximate Unification in the Description Logic in LOGICS IN ARTIFICIAL INTELLIGENCE
  • 2016-06-06 Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts in THEORY OF COMPUTING SYSTEMS
  • 2016-05-31 The Hardest Language for Conjunctive Grammars in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2015-06-23 Generalized LR Parsing for Grammars with Contexts in COMPUTER SCIENCE -- THEORY AND APPLICATIONS
  • 2014-12-10 On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages in COMPUTING WITH NEW RESOURCES
  • 2014 Linear Grammars with One-Sided Contexts and Their Automaton Representation in LATIN 2014: THEORETICAL INFORMATICS
  • 2014 Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014
  • 2014 Input-Driven Pushdown Automata with Limited Nondeterminism in DEVELOPMENTS IN LANGUAGE THEORY
  • 2013 Improved Normal Form for Grammars with One-Sided Contexts in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2013 Reversibility of Computations in Graph-Walking Automata in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013
  • 2013 Unambiguous Conjunctive Grammars over a One-Letter Alphabet in DEVELOPMENTS IN LANGUAGE THEORY
  • 2012 Defining Contexts in Context-Free Grammars in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2012 On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2012 Homomorphisms Preserving Deterministic Context-Free Languages in DEVELOPMENTS IN LANGUAGE THEORY
  • 2012 Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints in LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING
  • 2012 Descriptional Complexity of Input-Driven Pushdown Automata in LANGUAGES ALIVE
  • 2012 Non-erasing Variants of the Chomsky–Schützenberger Theorem in DEVELOPMENTS IN LANGUAGE THEORY
  • 2011-08-04 Representing Hyper-arithmetical Sets by Equations over Sets of Integers in THEORY OF COMPUTING SYSTEMS
  • 2011-03-10 One-Nonterminal Conjunctive Grammars over a Unary Alphabet in THEORY OF COMPUTING SYSTEMS
  • 2011 Descriptional Complexity of Unambiguous Nested Word Automata in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2011 Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups in DEVELOPMENTS IN LANGUAGE THEORY
  • 2011 State Complexity of Operations on Input-Driven Pushdown Automata in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011
  • 2011 Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages in SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2011 State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS
  • 2010 On Language Equations XXK = XXL and XM = N over a Unary Alphabet in DEVELOPMENTS IN LANGUAGE THEORY
  • 2010 Least and Greatest Solutions of Equations over Sets of Integers in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010
  • 2010 Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm 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": "http://www.grid.ac/institutes/grid.15447.33", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.15098.35", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.410356.5", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.1374.1", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.470079.d", 
            "type": "Organization"
          }
        ], 
        "familyName": "Okhotin", 
        "givenName": "Alexander", 
        "id": "sg:person.012144356031.48", 
        "identifier": [
          {
            "name": "orcid_id", 
            "type": "PropertyValue", 
            "value": "0000-0002-1615-2725"
          }
        ], 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012144356031.48", 
          "https://orcid.org/0000-0002-1615-2725"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-06-01T22:52", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/person/person_698.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.012144356031.48'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     

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

    29 TRIPLES      11 PREDICATES      17 URIs      8 LITERALS      3 BLANK NODES

    Subject Predicate Object
    1 sg:person.012144356031.48 schema:affiliation Ne51d7da9fb954bdcbc51dc4a6e0683cd
    2 grid-institutes:grid.1374.1
    3 grid-institutes:grid.15098.35
    4 grid-institutes:grid.410356.5
    5 grid-institutes:grid.470079.d
    6 schema:familyName Okhotin
    7 schema:givenName Alexander
    8 schema:identifier Na0ddc87a355a4b6f92626dae80603cc0
    9 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012144356031.48
    10 https://orcid.org/0000-0002-1615-2725
    11 schema:sdDatePublished 2022-06-01T22:52
    12 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    13 schema:sdPublisher Nc0b30e7edefb4661997cf83b11e4e013
    14 sgo:license sg:explorer/license/
    15 sgo:sdDataset persons
    16 rdf:type schema:Person
    17 Na0ddc87a355a4b6f92626dae80603cc0 schema:name orcid_id
    18 schema:value 0000-0002-1615-2725
    19 rdf:type schema:PropertyValue
    20 Nc0b30e7edefb4661997cf83b11e4e013 schema:name Springer Nature - SN SciGraph project
    21 rdf:type schema:Organization
    22 Ne51d7da9fb954bdcbc51dc4a6e0683cd schema:affiliation grid-institutes:grid.15447.33
    23 sgo:isCurrent true
    24 rdf:type schema:OrganizationRole
    25 grid-institutes:grid.1374.1 schema:Organization
    26 grid-institutes:grid.15098.35 schema:Organization
    27 grid-institutes:grid.15447.33 schema:Organization
    28 grid-institutes:grid.410356.5 schema:Organization
    29 grid-institutes:grid.470079.d schema:Organization
     




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


    ...