| Publication | Date of Publication | Type |
|---|
The symmetric Post correspondence problem, and errata for the freeness problem for matrix semigroups
International Journal of Algebra and Computation | 2022-08-31 | Paper |
On the complexity of the word problem of the R. Thompson group V
| 2022-03-16 | Paper |
Evaluation problems for the Thompson group and the Brin-Thompson group, and their relation to the word problem
| 2021-11-16 | Paper |
New embeddings between the Higman-Thompson groups
Communications in Algebra | 2020-09-03 | Paper |
A monoid version of the Brin-Higman-Thompson groups
| 2020-06-27 | Paper |
The word problem of the Brin-Higman-Thompson groups
| 2020-06-26 | Paper |
The word problem of the Brin-Thompson group is \textsf{coNP}-complete
Journal of Algebra | 2020-03-24 | Paper |
The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic
Information Processing Letters | 2019-06-20 | Paper |
PSPACE-completeness of certain algorithmic problems on the subgroups of free groups
Automata, Languages and Programming | 2019-04-29 | Paper |
Global local covers
| 2019-04-02 | Paper |
Inverse monoids associated with the complexity class NP
Semigroup Forum | 2019-03-11 | Paper |
Polynomial-time right-ideal morphisms and congruences
International Journal of Algebra and Computation | 2018-10-10 | Paper |
Infinitely generated semigroups and polynomial complexity
International Journal of Algebra and Computation | 2016-07-15 | Paper |
Semigroups and one-way functions
International Journal of Algebra and Computation | 2015-04-21 | Paper |
A Wavelet-Based Almost-Sure Uniform Approximation of Fractional Brownian Motion with a Parallel Algorithm
Journal of Applied Probability | 2014-05-14 | Paper |
Monoids that map onto the Thompson-Higman groups
Semigroup Forum | 2012-03-23 | Paper |
Bernoulli measure on strings, and Thompson-Higman monoids.
Semigroup Forum | 2012-03-23 | Paper |
On the circuit-size of inverses
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
The Thompson-Higman monoids \(M_{k,i}\): the \(\mathcal J\)-order, the \(\mathcal D\)-relation, and their complexity.
International Journal of Algebra and Computation | 2011-05-03 | Paper |
The \(\mathcal R\)- and \(\mathcal L\)-orders of the Thompson-Higman monoid \(M_{k,1}\) and their complexity.
International Journal of Algebra and Computation | 2010-08-11 | Paper |
Deviation bounds for wavelet shrinkage
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
One-way permutations, computational asymmetry and distortion.
Journal of Algebra | 2008-12-12 | Paper |
Monoid generalizations of the Richard Thompson groups.
Journal of Pure and Applied Algebra | 2008-12-02 | Paper |
FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY
International Journal of Algebra and Computation | 2008-08-26 | Paper |
Two-letter group codes that preserve aperiodicity of inverse finite automata.
Semigroup Forum | 2008-04-03 | Paper |
On public-key cryptosystems based on combinatorial group theory
| 2007-02-13 | Paper |
CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
International Journal of Algebra and Computation | 2006-05-29 | Paper |
THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY
International Journal of Algebra and Computation | 2005-03-18 | Paper |
FUNCTIONS ON GROUPS AND COMPUTATIONAL COMPLEXITY
International Journal of Algebra and Computation | 2004-11-01 | Paper |
Isoperimetric functions of groups and computational complexity of the word problem
Annals of Mathematics. Second Series | 2003-10-05 | Paper |
Isoperimetric and isodiametric functions of groups
Annals of Mathematics. Second Series | 2003-10-05 | Paper |
A complete rewrite system and normal forms for \((S)_{\text{reg}}\)
Semigroup Forum | 2002-12-01 | Paper |
Infinite string rewrite systems and complexity
Journal of Symbolic Computation | 2002-04-29 | Paper |
Approximation of some NP-hard optimization problems by finite machines, in probability
Theoretical Computer Science | 2001-08-20 | Paper |
ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS
International Journal of Algebra and Computation | 2000-11-07 | Paper |
\texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
Theoretical Computer Science | 2000-08-21 | Paper |
Reductions and functors from problems to word problems
Theoretical Computer Science | 2000-06-04 | Paper |
Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
International Journal of Algebra and Computation | 1997-09-15 | Paper |
Two-way automata and length-preserving homomorphisms
Mathematical Systems Theory | 1996-05-27 | Paper |
scientific article; zbMATH DE number 459356 (Why is no real title available?)
| 1995-04-23 | Paper |
Formal languages defined by uniform substitutions
Theoretical Computer Science | 1994-09-25 | Paper |
Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science | 1994-05-18 | Paper |
The word problem of inverse monoids presented by one idempotent relator
Theoretical Computer Science | 1994-03-27 | Paper |
State-complexity of finite-state devices, state compressibility and incompressibility
Mathematical Systems Theory | 1993-08-22 | Paper |
Intersection and union of regular languages and state complexity
Information Processing Letters | 1993-01-17 | Paper |
Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations
Journal of Computer and System Sciences | 1993-01-17 | Paper |
Circuits over monoids: A fault model, and a trade-off between testability and circuit delay
Applied Mathematics Letters | 1993-01-05 | Paper |
ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
International Journal of Algebra and Computation | 1992-01-01 | Paper |
scientific article; zbMATH DE number 4195190 (Why is no real title available?)
| 1992-01-01 | Paper |
STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES
International Journal of Algebra and Computation | 1991-01-01 | Paper |
Two-way automaton computations
RAIRO - Theoretical Informatics and Applications | 1990-01-01 | Paper |
Semigroups whose idempotents form a subsemigroup
Bulletin of the Australian Mathematical Society | 1990-01-01 | Paper |
Concatenation of inputs in a two-way automaton
Theoretical Computer Science | 1989-01-01 | Paper |
Group theory via global semigroup theory
Journal of Algebra | 1989-01-01 | Paper |
The synthesis theorem for finite regular semigroups, and its generalization
Journal of Pure and Applied Algebra | 1988-01-01 | Paper |
Stability and J-depth of expansions
Bulletin of the Australian Mathematical Society | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4008683 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3899174 (Why is no real title available?)
| 1985-01-01 | Paper |
Iteration of expansions. Unambiguous semigroups
Journal of Pure and Applied Algebra | 1984-01-01 | Paper |
Almost finite expansions of arbitrary semigroups
Journal of Pure and Applied Algebra | 1984-01-01 | Paper |
Arbitrary vs. regular semigroups
Journal of Pure and Applied Algebra | 1984-01-01 | Paper |
Some properties of Higman-Thompson monoids and digital circuits
| N/A | Paper |
