Complexity of Checking Whether Two Automata Are Synchronized by the Same Language
نویسنده
چکیده
A deterministic finite automaton A is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton A to a particular one. We prove that it is a PSPACEcomplete problem to check whether the language of reset words for a given automaton coincides with the language of reset words for some particular automaton.
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملLogics and Automata for Software Model - Checking 1
While model-checking of pushdown models is by now an established technique in software verification, temporal logics and automata traditionally used in this area are unattractive on two counts. First, logics and automata traditionally used in model-checking cannot express requirements such as pre/post-conditions that are basic to software analysis. Second, unlike in the finite-state world, wher...
متن کاملTask Complexity Manipulation and EFL learners’ interactions in the process of collaborative pre-planning
Today, learners’ interaction and collaborative task performance have attracted increasing attention from language teachers and researchers. The present study investigated whether collaborative pre-planning, task complexity manipulation, and language proficiency level play a role in learners’ interactions. To this end, 128 EFL learners from two different language proficiency levels carried out t...
متن کاملDevelopment of Fluency, Accuracy, and Complexity in Productive Skills of EFL learners across Gender and Proficiency: A Chaos Complexity Approach
This study was an attempt to investigate the developmental rate of fluency, accuracy and complexity among 12 EFL learners within the framework of chaos complexity theory. To carry out this study, 6 female and 6 male participants in two levels of proficiency (pre-and upper-intermediate) were put in two classes taught by the same teacher and following the same course. Every two months (for a peri...
متن کامل