Name
Abstract | ||
|---|---|---|
We examine inkdots placed on the input string as a way of providing advice to finite automata, and establish the relations between this model and the previously studied models of advised finite automata. The existence of an infinite hierarchy of classes of languages that can be recognized with the help of increasing numbers of inkdots as advice is shown. We study randomly placed inkdots as advice to probabilistic finite automata, and demonstrate the superiority of this model over its deterministic version. Even very slowly growing amounts of space can become a resource of meaningful use if the underlying advised model is extended with access to secondary memory, while it is famously known that such small amounts of space are not useful for unadvised one-way Turing machines. The effects of different forms of advice on the succinctness of the advised machines are also examined. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Discrete mathematics,Succinctness,Finite-state machine,Turing machine,Probabilistic logic,Hierarchy,Mathematics,Auxiliary memory |
DocType | Volume | Citations |
Journal | abs/1509.03712 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Uğur Küçük | 1 | 0 | 1.01 |
| A. C. Cem Say | 2 | 193 | 26.13 |
| Abuzer Yakaryilmaz | 3 | 168 | 25.31 |