Pavel Goralcik

According to our database1, Pavel Goralcik authored at least 16 papers between 1980 and 2006.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2006
On Completing Partial Groupoids to Semigroups.
IJAC, 2006

2001
Towards parametrizing word equations.
ITA, 2001

1998
On the Disjunctive Set Problem.
Theor. Comput. Sci., 1998

1997
Functions for the General Solution of Parametric Word Equations.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1995
Rank Problems for Composite Transformations.
IJAC, 1995

1994
Efficient Solving of the Word Equations in One Variable.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1991
Alternation with a Pebble.
Inf. Process. Lett., 1991

Binary Patterns in Binary Words.
IJAC, 1991

Mutually Avoiding Ternary Words of Small Exponent.
IJAC, 1991

1986
How much Semigroup Structure is Needed to Encode Graphs?
ITA, 1986

Verifying Nonrigidity.
Inf. Process. Lett., 1986

On Discerning Words by Automata.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1982
A Game of Composing Binary Relations.
ITA, 1982

A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties.
Proceedings of the Automata, 1982

1981
Fast Recognition of Rings and Lattices.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
Testing of Properties of Finite Algebras.
Proceedings of the Automata, 1980


  Loading...