We describe a general automata-theoretic approach for analyzing the veri0cation problems of discrete timed automata (i.e., timed automata with integer-valued clocks) augmented with various data structures. Formally, let C be a class of nondeterministic machines with reversal-bounded counters and possibly other data structures (e.g., a pushdown stack, a queue, a read-write worktape, etc.). Let A...

Fuzzy tree automata are mathematical devices for modeling and analyzing vaguely defined structures. The behavior of a fuzzy automaton generates language by mapping set regular trees on ranked alphabet to membership values. It calculates the grade using rules that process their structural characteristics. This paper deals with constructing models satisfies given logical propositions (called prop...

We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network monitoring based on predicate logic. We investigate closure properties of the class of recognizableMK-fuzzy languages accepted by MKfuzzy automat...

1. Introduction Cellular Automata have generated much interest [1,2,3] because of their diverse behavior and usefulness as a discrete model for many processes. Wolfram's 1984 paper on universality and complexity in cellular automata [3,4] described four classes of behavior for automata: class 1 for homogeneous stable behavior, class 2 for simple periodic patterns, class 3 for chaotic aperiodic ...

Chaudhari S. R. ,Komejwar D. D. , On Fuzzy Pushdown Automata and their covering , International Journal of Computer Applications Vol. 46(8),2012 pp 27-33 Comon H. ,Dauchet M. ,Gilleron R. ,Jacquemard F. , Lugiez D. ,Loding C. ,Tison S. , and Tommasi M. , Tree Automata: techniques and apllications. (2007) Lee E. T. Fuzzy tree automata and syntactic pattern recognition, IEEE Trans Pattern Anal Ma...

Automata-based methods have been successfully employed to prove tight complexity bounds for reasoning in many classical logics, and in particular in Description Logics (DLs). Very recently, the ideas behind these automata-based approaches were adapted for reasoning also in fuzzy extensions of DLs, with semantics based either on finitely many truth degrees or the Gödel t-norm over the interval [...

Abstract In the search of topological superconductors, nailing down Fermiology normal state is as crucial a prerequisite unraveling superconducting pairing symmetry. particular, number time-reversal-invariant momenta (TRIM) in Brillouin zone enclosed by Fermi surfaces closely linked to class systems, and can experimentally be investigated. We report here detailed study de Haas van Alphen quantu...

We consider stateless counter machines which mix the features of one-head counter machines and a special type of two-head Watson-Crick automata (WK-automata). Our Watson-Crick counter machines are biologically motivated. They have two heads that read the input starting from the two extremes. The reading process is finished when there are no more symbols between the heads, i.e., every letter of ...

We study three notions of directability of fuzzy automata akin to the D1-, D2and D3-directability of nondeterministic automata. Thus an input word w of a fuzzy automaton is D1-directing if a fixed single state is reachable by w from all states, D2-directing if exactly the same states are reachable by w from every state, and D3-directing if there is a state reachable by w from every state. We st...