Name
Abstract | ||
|---|---|---|
The authors consider the problem of assigning more than one symbol of a finite alphabet A to the same key on a keyboard. Since multiple symbols of the alphabet A reside on the same key, the representations of all the words in a finite dictionary H need not be unique. The problem is one of optimally assigning the symbols of the alphabet to the keys of a given keyboard with a view to minimize the total number of words that have ambiguous representation. The problem is proven to be NP-hard. After presenting the only reported solution to the problem, a fast learning-automaton-based solution to this problem is reported. Experimental results demonstrating the power of this solution are presented |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1109/21.135704 | Systems, Man and Cybernetics, IEEE Transactions |
Keywords | Field | DocType |
adaptive systems,automata theory,computational complexity,keyboards,learning systems,optimisation,symbol manipulation,NP-hard,adaptive learning,fast learning-automaton-based solution,keyboard optimization,symbol assignment,symbol manipulation | Mathematical optimization,Automata theory,Symbol,Adaptive system,Computer science,Automaton,Artificial intelligence,Adaptive learning,Optimization problem,Word processing,Machine learning,Computational complexity theory | Journal |
Volume | Issue | ISSN |
21 | 6 | 0018-9472 |
Citations | PageRank | References |
11 | 0.97 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. John Oommen | 1 | 759 | 143.24 |
| R. S. Valiveti | 2 | 30 | 6.19 |
| Zgierski, J.R. | 3 | 16 | 2.01 |