• The Pure and Applied Mathematics
• /
• v.9 no.2
• /
• pp.119-128
• /
• 2002

We here characterize semigroups (which are called completely right projective semigroups) for which every S-automaton is projective, and then examine some of the relationships with the semigroups (which are called completely right injective semigroups) in which every S-automaton is injective.

• Journal of KIISE:Software and Applications
• /
• v.35 no.11
• /
• pp.701-704
• /
• 2008

A general automaton allows multiple input transitions, so a special treatment is required when the history of transitions is needed. An LR automaton keeps the past transitions in the stack to use them during parsing. On the other hand, when each state in an automaton contains in itself the past transition history, the trace overhead of past transitions is unnecessary. The paper suggests a single state parsing automaton that does not depend on the past transitions. The applicable grammar class is less than LR grammars, but each state in a new automaton contains the past information, so the tracing of the history is not required compared to LR automaton.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.639-649
• /
• 2010

In this paper, a definition of interval-valued fuzzy regular language (IVFRL) is proposed and their related properties studied. A model of finite automaton (DFA and NDFA) with interval-valued fuzzy transitions is proposed. Acceptance of interval-valued fuzzy regular language by the finite automaton (DFA and NDFA) with interval-valued fuzzy transitions are examined. Moreover, a definition of finite automaton (DFA and NDFA) with interval-valued fuzzy (final) states is proposed. Acceptance of interval-valued fuzzy regular language by the finite automaton (DFA and NDFA) with interval-valued fuzzy (final) states are also discussed. It is observed that, the model finite automaton (DFA and NDFA) with interval-valued fuzzy (final) states is more suitable than the model finite automaton (DFA and NDFA) with interval-valued fuzzy transitions for recognizing the interval-valued fuzzy regular language. In the end, interval-valued fuzzy regular expressions are defined. We can use the proposed interval-valued fuzzy regular expressions in lexical analysis.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.671-678
• /
• 2005

In this paper we shall give some characterizations of strongly cyclic and totally reachable (TR) automata when A = (M, X, $\delta$) is MinCR-automaton. Also we shall see that if an automaton A is strongly cyclic, then A is cyclic and a TR-automaton. When A is MinmaxCR-automaton, we shall give another characterizations for a strongly cyclic and cyclic TR-automaton.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.851-858
• /
• 1999

A new problem of the theory of finite automata (Rabin-Scott's automata) is considered. So called basis automaton for the given regular language l is defined. this automaton is unique for the given L, it is defined by two au-tomata of canonical form: for L and for its inverse language LR. Some properties of basis automata are considered. Such properties make these automata most convenient for using in some special tasks dealing with the given regular language.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.409-417
• /
• 2009

A definition of finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states is proposed. Acceptance of intuitionistic fuzzy regular language by the finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states are examined. It is found that the finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states is more suitable for recognizing intuitionistic fuzzy regular language than earlier model. The paper also gives an idea of intuitionistic fuzzy regular expressions through possible definitions.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.645-655
• /
• 2002

In this Paper we consider non-deterministic finite Rabin-Scott's automata. We define special abstract objects, being pairs of values of states-marking functions. On the basis of these objects as the states of automaton, we define its edges; the obtained structure is considered also as a non-deterministic automaton. We prove, that any edge of any non-deterministic automaton defining the given regular language can be obtained by such techniques. Such structure can be used for solving various problems in the frames of finite automata theory.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.135-150
• /
• 2002

The present paper discusses non-deterministic finite Rabin-scott's automate. The majority of works recently dealing with this subject were, in fact, concerned only with properties of a canonical term automata or of some objects equivalent to it. This article continues the series of works in which the authors state a different point of view, describing the finite automata as just another invariant of the given regular language called basis finite automaton. In this article the authors argue on some new properties for the basis finite automaton. One of them is included into basis automaton's table of binary relations. It is stated that this table can not contain either identical strings or identical columns. Another property depicts a possibility to obtain any finite automaton for a given regular language by the process of duplicating or combining some of its states.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.67-73
• /
• 2011

We investigate some conditions for hybrid cellular automata to be group cellular automata.

• East Asian mathematical journal
• /
• v.25 no.4
• /
• pp.517-525
• /
• 2009

We discuss group orders and lengths of cycles of state transition diagrams of cellular automata.