Predictable semiautomata

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Predictable semiautomata

We introduce a new class of nondeterministic semiautomata: A nondeterministic semiautomaton S is predictable if there exists k ≥ 0 such that, if S knows the current input a and the next k inputs, the transition under a can be made deterministically. Nondeterminism may occur only when the length of the unread input is ≤ k. We develop a theory of predictable semiautomata. We show that, if a semia...

متن کامل

The Structure and Two Complexities of Economic Choice Semiautomata

The structure of choice implementing semiautomata is characterized. In contrast to the more commonly used directed graph representation of the semiautomaton, the primary representation here is as a transformation semigroup. For convenience the means for determining the directed graph representation also is presented. Associated with the choice implementing semiautomata are two complexities; alg...

متن کامل

Representation of a class of nondeterministic semiautomata by canonical words

It has been shown recently that deterministic semiautomata can be represented by canonical words and equivalences; that work was motivated by the trace-assertion method for specifying software modules. Here, we generalize these ideas to a class of nondeterministic semiautomata. A semiautomaton is settable if, for every state q, there exists a word wq such that q, and no other state, can be reac...

متن کامل

Representation of Semiautomata by Canonical Words and Equivalences

We study a novel representation of semiautomata, which is motivated by the method of trace-assertion specifications of software modules. Each state of the semiautomaton is represented by an arbitrary word, the canonical word leading to that state. The transitions of the semiautomaton give rise to a right congruence, the state-equivalence, on the set of input words of the semiautomaton: two word...

متن کامل

Are Emojis Predictable?

Emojis are ideograms which are naturally combined with plain text to visually complement or condense the meaning of a message. Despite being widely used in social media, their underlying semantics have received little attention from a Natural Language Processing standpoint. In this paper, we investigate the relation between words and emojis, studying the novel task of predicting which emojis ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2009

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2009.05.010