Pavel Goralcik

Int. J. Algebra Comput., 2006

2001

Towards parametrizing word equations.

[BibT_eX]

[DOI]

Habib Abdulrab

G. S. Makanin

RAIRO Theor. Informatics Appl., 2001

1998

On the Disjunctive Set Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

1997

Functions for the General Solution of Parametric Word Equations.

[BibT_eX]

[DOI]

G. S. Makanin

Habib Abdulrab

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1995

Rank Problems for Composite Transformations.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1995

1994

Efficient Solving of the Word Equations in One Variable.

[BibT_eX]

[DOI]

S. Eyono Obono

M. N. Maksimenko

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1991

Alternation with a Pebble.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Binary Patterns in Binary Words.

[BibT_eX]

[DOI]

Tomas Vanicek

Int. J. Algebra Comput., 1991

Mutually Avoiding Ternary Words of Small Exponent.

[BibT_eX]

[DOI]

Maxime Crochemore

Int. J. Algebra Comput., 1991

1986

How much Semigroup Structure is Needed to Encode Graphs?

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1986

Verifying Nonrigidity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

On Discerning Words by Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1982

A Game of Composing Binary Relations.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1982

A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1982

1981

Fast Recognition of Rings and Lattices.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Testing of Properties of Finite Algebras.

[BibT_eX]

[DOI]