Preimage problems for deterministic finite automata
Reads0
Chats0
TLDR
In this paper, the authors study three natural problems concerning words giving certain preimages. And they conclude with a summary of the complexities in all combinations of the cases, including variants where the length of the word is upper bounded, where the size of the given subset is restricted, and where the automaton is strongly connected, synchronizing, or binary.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2021-02-01 and is currently open access. It has received 5 citations till now. The article focuses on the topics: Deterministic finite automaton & Word (computer architecture).read more
Citations
More filters
Book ChapterDOI
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
TL;DR: In this paper, the authors investigated the constrained synchronization problem for weakly acyclic input automata and gave a classification of realizable complexities for constraint automata with at most two states and over a ternary alphabet.
Posted Content
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
TL;DR: In this paper, the constrained synchronization problem for weakly acyclic input automata was investigated and it was shown that the problem is always in polynomial time solvable.
Journal ArticleDOI
Синхронизация конечных автоматов
К Н Волков,Mikhail V. Volkov +1 more
TL;DR: In this article , the authors propose an approach to deal with the problem of the lack of a sufficient number of translational data points in the context of data mining. But this approach is limited to the following:
Book ChapterDOI
Some Results Concerning Careful Synchronization of Partial Automata and Subset Synchronization of DFA's
TL;DR: In this article , the authors presented a family of partial automata that achieved a subexponential length of the shortest carefully synchronizing words using 2.9n + 2.2π letters.
References
More filters
Journal ArticleDOI
Depth-First Search and Linear Graph Algorithms
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
Proceedings ArticleDOI
Lower bounds for natural proof systems
TL;DR: A lower space bound of n/log(n) is shown for the proof system for the PTIME complete theory and a lower length bound of 2cn/log('n'): length of polynomial space for the PSPACE complete theory.
Book ChapterDOI
Synchronizing Automata and the Černý Conjecture
TL;DR: Some recent advances towards a solution of the Cerný conjecture are discussed and several results and open problems related to synchronizing automata are surveyed.
Journal ArticleDOI
Reset sequences for monotonic automata
TL;DR: A new algorithm based on breadth-first search is presented that runs in faster asymptotic time than Natarajan’s algorithms, and in addition finds the shortest possible reset sequence if such a sequence exists.
Journal ArticleDOI
DNA molecule provides a computing machine with both data and fuel
TL;DR: It is shown that a single DNA molecule can provide both the input data and all of the necessary fuel for a molecular automaton, which can, in principle, process any input molecule of any length without external energy supply.