Sciweavers

1449 search results - page 132 / 290
» Finiteness results for sigmoidal
Sort
View
TCS
2008
15 years 6 months ago
On periodicity of two-dimensional words
A two-dimensional word is a function on Z2 with finite number of values. The main problem we are interested in is periodicity of twodimensional words satisfying some local conditi...
S. A. Puzynina, Sergey V. Avgustinovich
TCS
2008
15 years 6 months ago
Simple permutations: Decidability and unavoidable substructures
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
Robert Brignall, Nikola Ruskuc, Vincent Vatter
TCS
2008
15 years 6 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
TCS
2008
15 years 6 months ago
On varieties of meet automata
Eilenberg's variety theorem gives a bijective correspondence between varieties of languages and varieties of finite monoids. The second author gave a similar relation between...
Ondrej Klíma, Libor Polák
APAL
2000
90views more  APAL 2000»
15 years 6 months ago
The definable multiplicity property and generic automorphisms
Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T {" is an automorphism"} is an elementary clas...
Hirotaka Kikyo, Anand Pillay