最大乘积型Fuzzy上下无关文法与下推自动机

在文献[1]的基础上,讨论了最大乘积型Fuzzy上下文无关文法与最大乘积型Fuzzy下推自动机的关系,即:由给定的最大乘积型Fuzzy上下文无关文法可构造一个最大乘积型Fuzzy下推自动机使得二者接受的语言集相同,反之亦然。从而达到自动识别语言的目的。     

幺半环上几类模糊自动机的关系

给出了幺半环上非确定的模糊自动机和确定的模糊自动机及其语言的定义,证明了幺半环上三类非确定的模糊自动机间的等价性和三类确定的模糊自动机间的等价性,讨论了幺半环上三类非确定的模糊自动机和第四类非确定的模糊自动机之间的关系,以及幺半环上非确定的模糊自动机和确定的模糊自动机之间的关系.     

确定权重有限自动机的同余及极小自动机

主要研究对象是强双幺半群上的确定权重有限自动机A.首先给出了A上的同态定理和同构定理;接着,构造了识别φ的一个极小自动机Aφ;最后,证明极小自动机在同构意义下是唯一的.     

具有输出字符功能的模糊自动机的最小化问题

通过文献[8]中两类具有输出字符功能的Fuzzy自动机和Fuzzy有限状态自动机的强等价性,等价性和弱等价性的条件,在以往仅仅给出的Fuzzy有限状态自动机的最小化问题基础上,讨论了具有更广泛意义的具有输出字符功能的Fuzzy自动机的最小化问题,以及其最小化自动机与Fuzzy有限状态自动机的最小化自动机在不同条件下的关系。     

关于Fuzzy3型文法与Fuzzy有限态自动机的关系

本文首先讨论了确定的Fuzzy有限态自动机与非确定的Fuzzy有限态自动机之间的转换关系,在此基础上研究了Fuzzy 3型文法与Fuzzy有限态自动机的关系问题,得出了两个有实用价值的定理。这两个定理为进一步研究Fuzzy文法的理论及其应用奠定了基础。定理1 设(?)是由一个非确定的Fuzzy有限态自动机FA=(∑,Q,δ,q_0,F)所接受的Fuzzy链集,则有一个能接受(?)的确定的Fuzzy有限态自动机FA′=(∑′,Q′,δ′,     

语言的幂级数表达式和有限自动机状态方程的近似解法

一、预备知识 具有初始状态和最终状态的有限自动机是一个5维系统。设M=(Q,Σ,q_1,δ,T),其中Σ为输入的有限字母表,Q为有限状态集,q_1,T分别为初始状态和终结状态集合,并且T(?)Q.δ为状态转移函数.δ:Q×Σ→Q 当δ为单值函数时,M为确定有限自动机;如果δ为半序函数时,则M为不完全确定有限自动机。本文讨论不限于确定有限自动机。为方便起见,以下简称M为机器。     

关于无穷小量乘积的讨论

本文由有限个无穷小量的乘积仍是无穷小量的证明入手 ,给出无穷多个无穷小量的乘积不一定是无穷小量的例子 ,并根据这种方法得到无穷多个无穷大量的和也不一定是无穷大量的结论     

模糊Rabin自动机和模糊Game自动机的等价性

自动机是理论计算机的一个重要的研究内容.模糊Rabin自动机和模糊Game自动机是经典自动机的延续,给出了模糊Rabin自动机和模糊Game自动机的相关定义,讨论各自的内在性质,并得到了二者的等价关系.这进一步丰富了模糊自动机理论.     

状态转移函数对加权自动机计算能力的影响

在非确定型加权自动机(NS-WA)与确定型加权自动机(DS-WA)的基础上,引入了状态转移函数是分明的非确定型加权自动机(NS-WA_c)与状态转移函数是分明的带空移动的非确定型加权自动机(NS-WA_(ε-c))的概念。在已知NS-WA与DS-WA不等价的结论下,进一步探究了NS-WA_c、NS-WA_(ε-c)与DS-WA之间的等价性,并给出了等价性证明以及相关的算法和例子。     

建立在模糊逻辑上的模糊元胞自动机

总结了经典元胞自动机模型理论,并在此基础上把模糊逻辑引入元胞自动机模型中.通过对模糊元胞自动机的基本原理的分析,定义了模糊元胞自动机模型.模糊元胞自动机模型可以处理模糊信息,并且使模拟与现实世界的情况更为接近.     

Exact enumeration of acyclic deterministic automata

A linear recurrence relation is derived for the number of unlabelled initially connected acyclic automata. The coefficients of this relation are determined by another, alternating, recurrence relation. The latter determines, in particular, the number of acyclic automata with labelled states. Certain simple enumerative techniques developed by the author for counting initially connected automata and acyclic digraphs are combined and applied. Calculations show that the results obtained in this paper improve recent upper bounds for the number of minimal deterministic automata (with accepting states) recognizing finite languages. Various related questions are also discussed.     

Deterministic automata simulation, universality and minimality

Finite automata have been recently used as alternative, discrete models in theoretical physics, especially in problems related to the dichotomy between endophysical/intrinsic and exophysical/ extrinsic perception (see, for instance [3, 6, 18–21]). These studies deal with Moore experiments; the main result states that it is impossible to determine the initial state of an automaton, and, consequently, a discrete model of Heisenberg uncertainty has been suggested. For this aim the classical theory of finite automata — which considers automata with initial states — is not adequate, and a new approach is necessary. A study of finite deterministic automata without initial states is exactly the aim of this paper. We will define and investigate the complexity of various types of simulations between automata. Minimal automata will be constructed and proven to be unique up to an isomorphism. We will build our results on an extension of Myhill-Nerode technique; all constructions will make use of “automata responses” to simple experiments only, i.e., no information about the internal machinery will be considered available.     

Tree template matching in ranked ordered trees by pushdown automata

We consider the problem of tree template matching in ranked ordered trees, and propose a solution based on the bottom-up technique. Specifically, we transform the tree pattern matching problem to a string matching problem, by transforming the tree template and the subject tree to strings representing their postfix notation, and then use pushdown automata as the computational model. The method is analogous to the construction of string pattern matchers. The given tree template is preprocessed once, by constructing a nondeterministic pushdown automaton, which is then transformed to the equivalent deterministic one. Although we prove that the space required for preprocessing is exponential to the size of the tree template in the worst case, the space required for a specific class of tree templates is linear. The time required for the searching phase is linear to the size of the subject tree in both cases.     

Approximate String Matching Using Deformed Fuzzy Automata: A Learning Experience

Deformed fuzzy automata are complex structures that can be used for solving approximate string matching problems when input strings are composed by fuzzy symbols. Different string similarity definitions are obtained by the appropriate selection of fuzzy operators and parameters involved in the calculus of the automaton transitions. In this paper, we apply a genetic algorithm to adjust the automaton parameters for selecting the ones best fit to a particular application. This genetic approach overcomes the difficulty of using common optimizing techniques like gradient descent, due to the presence of non-derivable functions in the calculus of the automaton transitions. Experimental results, obtained in a text recognition experience, validate the proposed methodology.     

Finite turns and the regular closure of linear context-free languages

Turn bounded pushdown automata with different conditions for beginning a new turn are investigated. Their relationships with closures of the linear context-free languages under regular operations are studied. For example, automata with an unbounded number of turns that have to empty their pushdown store up to the initial symbol in order to start a new turn are characterized by the regular closure of the linear languages. Automata that additionally have to re-enter the initial state are (almost) characterized by the Kleene star closure of the linear languages. For both a bounded and an unbounded number of turns, requiring to empty the pushdown store is a strictly stronger condition than requiring to re-enter the initial state. Several new language families are obtained which form a double-stranded hierarchy. Closure properties of these families under AFL operations are derived. The regular closure of the linear languages share the strong closure properties of the context-free languages, i.e., the family is a full AFL. Interestingly, three natural new language families are not closed under intersection with regular languages and inverse homomorphism. Finally, an algorithm is presented parsing languages from the new families in quadratic time.     

模糊有限自动机的乘积覆盖性

推广模糊有限自动机的有限积,包括direct infinite乘积、cascade infinite乘积和wreath infinite 来积.进而讨论它们之间的关系,得到乘积覆盖性等代数性质.     

On the bijective colouring of Cantor trees based on transducers

Given a vertex colouring of the infinite n-ary Cantor tree with m colours ($n,m\ge 2$), the natural problem arises: may this colouring induce a bijective colouring of the infinite paths starting at the root, i.e., that every infinite m-coloured string is used for some of these paths but different paths are not coloured identically? In other words, we ask if the above vertex colouring may define a bijective short map between the corresponding Cantor spaces. We show that the answer is positive if and only if $n\ge m$, and provide an effective construction of the bijective colouring in terms of Mealy automata and functions defined by such automata. We also show that a finite Mealy automaton may define such a bijective colouring only in the trivial case, i.e. $m=n$.     

A universal planar automaton is determined by its semigroup of input symbols

Universal planar automata are universally attracted objects in the category of automata, for which the set of states and the set of output symbols are equipped with structures of planes. We investigate the problem of determinability of these automata by their semigroups of input symbols.     

On minimal realization of fuzzy behaviour and associated categories

This paper is towards the study of minimal deterministic automata with fuzzy output which realizes the given fuzzy behaviour. The construction of such automaton is based on Myhill-Nerode’s theory, and it is shown that this automaton is a canonical realization of given fuzzy behaviour. Meanwhile, we introduce the categories of deterministic automata with fuzzy output and fuzzy behaviour. The relationship between both the categories through functors is also studied.