Sciweavers

3818 search results - page 59 / 764
» Word Problems on Compressed Words
Sort
View
TIT
2008
97views more  TIT 2008»
15 years 4 months ago
Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets
The problem of predicting a sequence x ; x ; . . . generated by a discrete source with unknown statistics is considered. Each letter x is predicted using the information on the wor...
Boris Ryabko, Jaakko Astola, Alexander Gammerman
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 4 months ago
The road coloring problem
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
A. N. Trahtman
CORR
2002
Springer
115views Education» more  CORR 2002»
15 years 4 months ago
Average-case complexity and decision problems in group theory
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
IJAC
2007
116views more  IJAC 2007»
15 years 4 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 4 months ago
Highly Undecidable Problems about Recognizability by Tiling Systems
Altenbernd, Thomas and W
Olivier Finkel