Tikhon Pshenitsyn

Orcid: 0000-0003-4779-3143

According to our database1, Tikhon Pshenitsyn authored at least 19 papers between 2020 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Complexity of the Uniform Membership Problem for Hyperedge Replacement Grammars.
CoRR, January, 2025

On decidability and expressive power of fusion grammars.
Theor. Comput. Sci., 2025

First-Order Intuitionistic Linear Logic and Hypergraph Languages.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

A Comparative Analysis of Deletion Closure Operations and Their Properties.
Proceedings of the Developments in Language Theory - 29th International Conference, 2025

2024
Bonding Grammars.
Proceedings of the Unconventional Computation and Natural Computation, 2024

2023
Commutative Lambek Grammars.
J. Log. Lang. Inf., December, 2023

Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing.
CoRR, 2023

Expressive Power of Hypergraph Lambek Grammars.
CoRR, 2023

Multimodality in the Hypergraph Lambek Calculus.
Proceedings of the Proceedings Modalities in substructural logics: Applications at the interfaces of logic, 2023

2022
Hypergraph Lambek grammars.
J. Log. Algebraic Methods Program., 2022

From Double Pushout Grammars to Hypergraph Lambek Grammars With and Without Exponential Modality.
Proceedings of the Proceedings Twelfth International Workshop on Computing with Terms and Graphs, 2022

Grammars over the Lambek Calculus with Permutation: Recognizing Power and Connection to Branching Vector Addition Systems with States.
CoRR, 2022

2021
Grammars Based on a Logic of Hypergraph Languages.
Proceedings of the Proceedings Twelfth International Workshop on Graph Computational Models, 2021

Cyclic Shift in the Lambek Calculus.
CoRR, 2021

Introduction to a Hypergraph Logic Unifying Different Variants of the Lambek Calculus.
CoRR, 2021

Powerful and NP-Complete: Hypergraph Lambek Grammars.
Proceedings of the Graph Transformation - 14th International Conference, 2021

Lambek Calculus with Optional Divisions.
Proceedings of the Selected Reflections in Language, Logic, and Information - ESSLLI 2019, 2021

2020
Weak Greibach Normal Form for Hyperedge Replacement Grammars.
Proceedings of the Eleventh International Workshop on Graph Computation Models, 2020

Hypergraph Basic Categorial Grammars.
Proceedings of the Graph Transformation - 13th International Conference, 2020


  Loading...