• 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.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.

• Language and Information
• /
• v.5 no.2
• /
• pp.1-8
• /
• 2001

Natural language string sets are known to require a grammar with a generative capacity slightly beyond that of Context Free Grammars. Proofs regarding complexity of natural language have involved particular properties of languages like English, Swiss German and Bambara. While it is not very difficult to prove that Korean is more complex than the simplest of the many infinite sets, no proof has been given of this in the literature. I identify two types of center embedding in Korean and use them in proving that Korean is not a regular set, i.e. that no FSA's can recognize its string set. The regular language i salam i (i salam ul$)^j$ michi (key ha)^k$ essta is intersected with Korean, to give {i salam i (i salam ul$)^j$ michi (key ha$)^k$ essta i $$\mid$$ j, k $\geq$ 0 and j $\leq$ k}. This latter language is proved to be nonregular. As the class of regular sets is closed under intersection, Korean cannot be regular.

• 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 Information Processing Systems
• /
• v.19 no.1
• /
• pp.1-16
• /
• 2023

Synthetic data generation is generally used in performance evaluation and function tests in data-intensive applications, as well as in various areas of data analytics, such as privacy-preserving data publishing (PPDP) and statistical disclosure limit/control. A significant amount of research has been conducted on tools and languages for data generation. However, existing tools and languages have been developed for specific purposes and are unsuitable for other domains. In this article, we propose a regular expression-based data generation language (DGL) for flexible big data generation. To achieve a general-purpose and powerful DGL, we enhanced the standard regular expressions to support the data domain, type/format inference, sequence and random generation, probability distributions, and resource reference. To efficiently implement the proposed language, we propose caching techniques for both the intermediate and database queries. We evaluated the proposed improvement experimentally.

• 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.

• International Journal of Advanced Culture Technology
• /
• v.9 no.4
• /
• pp.86-93
• /
• 2021

This paper aims to investigate a novel affix prevalently and productively used in social media, which is assumed to be borrowed from English into Korean loanblens. The novel affix is composed of a prefix-like and a suffix-like elements, but it seems to be distinguished from other regular combinations of a prefix and a suffix. In analyzing the affix, we attempt to highlight its peculiarities of the affix with empirical data. First, the seemingly borrowed affix does not behave like affixes found in the donor language (English) or the recipient language (Korean) from a linguistic point of view. Both languages have circumfixation rarely available in productive word-formation processes. Second, no regular assimilation rules of Korean apply to the affix boundary, which would otherwise be mandatory to such syllable contact contexts. Last but not least, the affix form has no correspondence to the donor language, and therefore it is claimed to be derived through secretion and taken as a case of pseudo-anglicisms.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 1995.02a
• /
• pp.267-272
• /
• 1995

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2C
• /
• pp.1-9
• /
• 2005

Code is a set of words. If, for any pair of words in the code, one is not prefix of another, the code is called "Prefix(-Free) Code". The prefix coding problem is, given n, to find an optimal code with the minimum-sum of lengths of n words. As a special case of this, we present a method to find, given language L in some specific classes of regular languages, an optimal code among prefix codes in L. We also show how the structure of optimal codes varies as n grows, using trees.