FIGURE 3 - uploaded by Yee siang Gan
Content may be subject to copyright.
Source publication
A finite automaton is one of the classic models of recognition devices,
which is used to determine the type of language a string belongs to. A
string is said to be recognized by a finite automaton if the automaton
"reads" the string from the left to the right starting from the initial
state and finishing at a final state. Another type of automata w...
Context in source publication
Similar publications
This paper proposes to statistically gauge the degree of matching of keywords in input strings using finite automata, in order to grade strings in the order of relevance with respect to the given keyword. The non-extensive entropy with the Gaussian information gain function proposed by Susan and Hanmandlu for the representation of regular patterns...
The equivalence of different forms of automata provides a lot of convenience for us to solve practical problems. Sometimes, for efficient use of a fuzzy finite automaton, it is preferable to remove all ε-transitions since in general they induce a delay in their using, that is, to create an equivalent fuzzy finite automaton with no ε-transition. An...
Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels the frameworks of finite automata for strings and finite tree automata for trees. A possible starting...
This dissertation thesis deals with particular types of string regularities, covers and seeds.
We say that factor (possibly approximate) of a string is its cover if the string may be
constructed just using superpositions of the cover. Seed of a string is a generalization of
cover such that seed is a cover of an extension of that string. In this dis...
Automata act as classical models for recognition devices. From the previous researches, the classical models of automata have been used to scan strings and to determine the types of languages a string belongs to. In the study of automata and group theory, it has been found that the properties of a group can be recognized by the automata using the a...
Citations
Recently, the relation of automata and groups has been studied. It was shown that properties of groups can be
studied using state diagrams of modified automata and modified Watson-Crick automata. In this work, we investigate the
relation of subgroups with the modified finite and Watson-Crick automata. We also establish the conditions for the
recognition of subgroups by using the modified automata.
