Two-way finite automata with quantum and classical states (2qcfa’s) were introduced by Ambainis and Watrous. Though this computing model is more restricted than the usual two-way quantum finite automata (2qfa’s) first proposed by Kondacs and Watrous, it is still more powerful than the classical counterpart. In this note, we focus on dealing with the operation properties of 2qcfa’s. We prove tha...

Finding frequent fuzzy itemsets in operational quantitative databases is a significant challenge for association rule mining the context of data mining. If are detected, decision-making process and formulating strategies businesses will be made more precise. Because characteristic these models large number transactions unlimited high-speed productions. This leads to limitations calculating supp...

We show how to minimize biautomata with a Brzozowski-like algorithm by applying reversal and powerset construction twice. Biautomata were recently introduced in [O. Kĺıma, L. Polák: On biautomata. RAIRO—Theor. Inf. Appl., 46(4), 2012] as a generalization of ordinary finite automata, reading the input from both sides. The correctness of the Brzozowski-like minimization algorithm needs a little b...

Because of the reason that the individuals’ thoughts have the complicated and uncertain characteristics in the field of social science, this study makes the most of the fuzzy sets, which solve uncertain and imprecise conditions, to transform the opinions belonging to human beings into the quantitative numbers. Advertising involvement is regarded as the object for this empirical study which comp...

This paper presents a fuzzy inference guided cellular automata approach. Semantic or linguistic knowledge on urban development is expressed as fuzzy rules, based on which fuzzy inference is applied to determine the urban development potential for each pixel. A defuzzification process converts the development potential to the required neighborhood development level, which is taken by cellular au...

This paper is concerned with the widest class of automaton structures whose semantics is compatible with our notions of state and automaton. It is first shown that the conventional spectrum of deterministic, stochastic, fuzzy and non-deterministic can be fitted into a single framework which is complete. In particular new results on the normalization of fuzzy automata and the relationship betwee...

The Section on Medical Expert and Knowledge-Based Systems at the Department of Medical Computer Sciences pursues methodological research in and practical development of knowledge-based computer systems to assist in the decision-making processes for all areas of medical application. Vagueness of medical terms, uncertainty in the co-occurrence of medical entities, and incompleteness in medical th...

Recently, attention has been given to formally characterize security policies that are enforceable by different kinds of security mechanisms. A very important research problem is the characterization of security policies that are enforceable by execution monitors constrained by memory limitations. This paper contributes to give more precise answers to this research problem. To represent executi...

This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution property (SP) partition for a finite intuitionistic fuzzy automaton is formulated, and the quotient automaton with respect to an SP partition is defined.