• Title/Summary/Keyword: Regular Language

Search Result 129, Processing Time 0.023 seconds

2$\omega$-FINITE AUTOMATA AND SETS OF OBSTRUCTIONS OF THEIR SLNGUAGES

  • Duan, Qi;Li, Botang;Djidjeli, K.;Price, W.G.;Twizell, E.H.
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.3
    • /
    • pp.783-798
    • /
    • 1999
  • Nondeterministic finite Rabin-Scott's automata without initial and final states (2 $\omega$-FA) are considered. In this paper they are used to define so called sets of obstruction used also in various alge-braic systems and to consider similar problems for the formal languages theory. Thus we define sets of obstructions of languages(or, rather, 2$\omega$-languages) of such automata. We obtain that each 2$\omega$-language defined by 2 $\omega$-FA has the set of obstruction being a regular language. And vice versa for each regular language L(containing no proper subword of its another word) there exists a 2$\omega$ -FA having L as the set of obstructions.

On the regular expression of the node-significant sequential graph (점의미형(點意味型) 순서도(順序圖)의 정규표현(正規表現)에 관(關)한 연구(硏究))

  • Kim, Hyeon-Jae
    • Proceedings of the KIEE Conference
    • /
    • 1986.07a
    • /
    • pp.486-489
    • /
    • 1986
  • The transition diagram, as well as the regular expression, can be used as a formal description for a language acceptable by a finite automaton or for the behavior of a sequential switching circuit. But, if we are given one of these two descriptions, we shall find that it is not easy to get the other counterpart description. This paper is to show an easy method to find the equivalet regular expression from the transition diagram, by the aid of a graph-transformation technique.

  • PDF

A Historical Account of Some Alternating Patterns and Anomalies in Modem English

  • Moon, An-Nah
    • English Language & Literature Teaching
    • /
    • no.6
    • /
    • pp.75-88
    • /
    • 2000
  • There are many reasons why foreigners have difficulties learning English. In addition to the difference between English and the learner's grammar, the large number of irregularities found in English become another obstacle to learning English. Understanding the difference and the irregularities will help us not only have a good command of English but also teach English more effectively. Many irregular or alternating patterns, or even anomalies in Modern English are the results of historical changes. In this paper, I would like to focus on some of the irregular or alternating patterns found in different components of the grammar of English and to show how they can be accounted for historically. Through this study, I would like to show that the irregular patterns and anomalies in English were once regular and systematic, they have deviated from the regular patterns of the grammar as time has gone by, and they have survived in Modern English as irregular and alternating patterns. Many of the irregular or alternating patterns can be traced back by phonological, morphological and/or semantic changes in the history of English. Finally, by looking at language history, we can hold a more tolerant view on many anomalies present in English.

  • PDF

OBTAINING WEAKER FORM OF CLOSED SETS IN TOPOLOGICAL SPACE USING PYTHON PROGRAM

  • Prabu, M. Vivek;Rahini, M.
    • The Pure and Applied Mathematics
    • /
    • v.29 no.1
    • /
    • pp.93-102
    • /
    • 2022
  • The impact of programming languages in the research sector has helped lot of researchers to broaden their view and extend their work without any limitation. More importantly, even the complex problems can be solved in no matter of time while converting them into a programming language. This convenience provides upper hand for the researchers as it places them in a comfort zone where they can work without much stress. With this context, we have converted the research problems in Topology into programming language with the help of Python. In this paper, we have developed a Python program to find the weaker form of closed sets namely alpha closed set, semi closed set, pre closed set, beta closed set and regular closed set.

NFC based Alarm Patching System for Regular Time Management

  • Jung, Yong Gyu;Choi, Eun Hee;Kang, Min Soo;Cady, Jennifer J.
    • International journal of advanced smart convergence
    • /
    • v.4 no.1
    • /
    • pp.40-44
    • /
    • 2015
  • Most people do not think seriously about the concept of time management, just to spend the precious time sheets. Regular life can sustain mental and physical health. That's why time management is an important factor in living. In the thesis, smart alarm patch is designed using a wireless communication NFC technology that gradually develop and attract attention. Due to the alarm, regular hours is helped to improve the quality of life. For this, analysis was performed using the UML in this system, linked to the smart alarm system patches and NFC technology, Java Script language, Adobe Muse CC was used embody web document and mobile content.

Analogical Reasoning Skills and Metaphoric Understanding in School-age Children with Language Disabilities (학령기 언어장애아동의 유추추론능력과 은유이해능력 간의 상관관계연구)

  • Shin, Hu-Nam;Kwon, Do-Ha
    • MALSORI
    • /
    • no.67
    • /
    • pp.17-31
    • /
    • 2008
  • This study was designed to explore the analogical reasoning and metaphoric understanding in typically developing children and language impaired children. 13 Language-impaired children were matched to 16 typically developing children on the basis of receptive vocabulary age. All 29 children were enrolled in the 1st to 3rd grade in regular elementary schools. All were administered analogical reasoning and metaphoric tasks. Results indicated that the children with language disabilities did not perform as well as the receptive vocabulary matched group on the two tasks. In addition, we found that both of children with and without language disabilities did not have relationship between analogical reasoning and metaphoric understanding.

  • PDF

EDGE-MINIMIZATION OF NON-DETERMINISTIC FINITE AUTOMATA

  • Melnikov, B.F.;Melnikova, A.A.
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.3
    • /
    • pp.693-703
    • /
    • 2001
  • In this paper we consider non-deterministic finite Rabin-Scott’s automata. We use a special structure to descibe all the possible edges of non-determinstic finite automaton defining the given regular language. Such structure can be used for solving various problems of finite automata theory. One of these problems is edge-minimization of non-deterministic automata. As we have not touched this problem before, we obtain here two versions of the algorithm for solving this problem to continue previous series of articles.

A Flexible Query Processing System for XML Regular Path Expressions (XML 정규 경로식을 위한 유연한 질의 처리 시스템)

  • 김대일;김기창;김유성
    • Journal of KIISE:Databases
    • /
    • v.30 no.6
    • /
    • pp.641-650
    • /
    • 2003
  • The eXtensible Markup Language(XML) is emerging as a standard format of data representation and exchange on the Internet. There have been researches about storing and retrieving XML documents using the relational database which has techniques in full growth about large data processing, recovery, concurrency control and so on. Since in previous systems same structure information and fundamental operation are used for processing of various kinds of XML queries, only some specific query can be efficiently processed not all types of query. In this paper, we propose a flexible query processing system. To process query efficiently, the proposed system analyzes regular path expression queries, and uses $\theta$-join operation using region numbering values to check ancestor-descendent relationship and equi-join operation using parent's region start value to check parent-child relationship. Thus, the proposed system processes efficiently XML regular path expressions. From the experimental results, we show that proposed XML query processing system is more efficient than previous systems.

Married Female Immigrants' Experience of Investing in Human Capital (결혼이주여성의 인적자본투자 경험에 관한 연구)

  • Hong, Sung-Hee
    • Journal of Family Resource Management and Policy Review
    • /
    • v.17 no.4
    • /
    • pp.145-170
    • /
    • 2013
  • The purpose of this study was to figure out married female immigrants' experience and process of investing in human capital in Korea. The participants were 11 women from multicultural families who had experience of investing in human capital in Korea, could communicate in the Korean language, and were living in Daegu. The data were collected using intensive interviews. The major findings were as follows: The participants' level of education and work experience in native country were not accepted as human capital and offered no advantages or obtaining employment in Korea, while English language skills were useful for those pursuing an English lecturer position. The motives for investing in human capital were 'adjusting to early stage of marriage and a new environments', 'for their childrens' education', 'to improve female immigrants' level of education', 'seeking a better job', and 'advocating more education'. The types of investing in human capital were 'learning Korean language and culture', 'applying to Open University or taking a middle or high school qualification examination', 'obtaining certification', and 'entering regular university'. The participants' plans for investing in the future were 'finding their own job', 'entering regular university', and 'participating in useful educational programs including Korean language skills for daily life' The results showed that the participants' motives for investing in human capital were related in the stage of their marriage. The phases and changes in their motives during a marriage proved that the participants continued to invest in human capital according to their needs and situation.

  • PDF

Stochastic Modeling and Concurrent Simulation of the Game of Golf

  • Yoon, Sung-Roh;Lee, Se-Il;Oh, Seong-Jun
    • ETRI Journal
    • /
    • v.31 no.6
    • /
    • pp.809-811
    • /
    • 2009
  • We propose a novel simulation method for modeling the game of golf using SystemC, a system description language that allows modeling of a concurrent system's behavior. Utilizing the proposed simulator, we compare different outing formats of golf, namely, regular and shotgun, in terms of playing time. Our simulation results reveal that the shotgun format can take longer than the regular format if the number of groups in a golf course exceeds 33 for the scenario we tested, confirming the belief that the shotgun format can take longer than the regular format. We also justify our simulation by comparing the simulation and analytical results.