The complexity of promise problems with applications to public-key cryptography
Information and Control
Online computation and competitive analysis
Online computation and competitive analysis
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
On the Advice Complexity of Online Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Assisted problem solving and decompositions of finite automata
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Simplifying DPDA using supplementary information
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
| Hi-index | 0.89 |
In this paper, we continue the research on formal treatment of attributes of information, based on the computational approach. In this scenario, the usefulness of advisory information is measured by the decrease in complexity of a problem we need to solve. We propose to model the time criticality via usefulness of a piece of information which is received during the computation. As a modeling tool, we use deterministic finite automata. We give two definitions of time criticality. In the static case, we consider supplementary information which concerns the entire input instance. In the dynamic case, we consider information about the unprocessed part of the input. Despite the simplicity of our model, we shall see that the development of time criticality may exhibit an interesting behavior.