2 citations · 10 across the 16 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.LO2024
Reasoning from hypotheses in *-continuous action lattices
Stepan L. Kuznetsov, Tikhon Pshenitsyn, Stanislav O. Speranski
The class of all -continuous Kleene algebras, whose description includes an infinitary condition on the iteration operator, plays an important role in computer science. The c…
cs.FL2024
Bonding Grammars
Tikhon Pshenitsyn
We introduce bonding grammars, a graph grammar formalism developed to model DNA computation by means of graph transformations. It is a modification of fusion grammars introduced by…