Lengths of words accepted by nondeterministic finite automata
نویسندگان
چکیده
منابع مشابه
Lengths of Words Accepted by Nondeterministic Finite Automata
We consider two natural problems about nondeterministic finite automata. First, given such an automaton M of n states, and a length `, does M accept a word of length `? We show that the classic problem of triangle-free graph recognition reduces to this problem, and give an O(nω(log n)1+ log `)-time algorithm to solve it, where ω is the optimal exponent for matrix multiplication. Second, provide...
متن کاملShortest Repetition-Free Words Accepted by Automata
We consider the following problem: given that a finite automaton M of N states accepts at least one k-power-free (resp., overlapfree) word, what is the length of the shortest such word accepted? We give upper and lower bounds which, unfortunately, are widely separated.
متن کاملEfficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata
In languages over a unary alphabet, i.e., an alphabet with only one letter, words can be identified with their lengths. It is well known that each regular language over a unary alphabet can be represented as the union of a finite number of arithmetic progressions. Given a nondeterministic finite automaton (NFA) working over a unary alphabet (a unary NFA), the arithmetic progressions representin...
متن کاملNondeterministic Finite Automata
This is an example of what is called a nondeterministic finite automaton (NFA). Intuitvely, such a machine could have many possible computations on a given input. For example, on an input of the form u001v, it is possible for the machine to reach the accepting state qp by transitioning from q to q0 after reading u. Similarly, it is possible for the machine to reach qp also on the input u01v — f...
متن کاملLanguages recognized by nondeterministic quantum finite automata
The nondeterministic quantum finite automaton (NQFA) is the only known case where a one-way quantum finite automaton (QFA) model has been shown to be strictly superior in terms of language recognition power to its probabilistic counterpart. We give a characterization of the class of languages recognized by NQFA's, demonstrating that it is equal to the class of exclusive stochastic languages. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2020
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2020.105993