• 제목/요약/키워드: regular state

검색결과 486건 처리시간 0.022초

A Regular Expression Matching Algorithm Based on High-Efficient Finite Automaton

  • Wang, Jianhua;Cheng, Lianglun;Liu, Jun
    • Journal of Computing Science and Engineering
    • /
    • 제8권2호
    • /
    • pp.78-86
    • /
    • 2014
  • Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order to reduce any unnecessary transition paths as well as to eliminate any unnecessary state transitions. Consequently, the problems of high memory access consumption and big storage space and long matching time during the regular expression matching process of XFA can be efficiently improved. The simulation results convey that our proposed scheme can lower approximately 40% memory access, save about 45% storage space consumption, and reduce about 12% matching time during the same regular expression matching process compared with XFA, but without degrading the matching quality.

POSSIBLE EDGES OF A FINITE AUTOMATON DEFINING A GIVEN REGULAR LANGUAGE

  • Melnikov, B.F.;Sciarini Guryanova, N.V.
    • Journal of applied mathematics & informatics
    • /
    • 제9권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.

국가지정 동산문화재의 정기조사제도 개선방안 연구 (A study on improvement of regular survey system of state-designated movable cultural heritage)

  • 이종숙;김창규
    • 헤리티지:역사와 과학
    • /
    • 제51권4호
    • /
    • pp.146-169
    • /
    • 2018
  • 현행 문화재보호법은 인위적이거나 자연적으로 형성된 국가적 민족적 또는 세계적 유산으로서 역사적 예술적 학술적 또는 경관적 가치가 큰 것을 문화재로 정의하고, 문화재의 성격에 따라 유형문화재, 무형문화재, 기념물, 민속문화재로 구분하고 있다. 그리고 지정주체에 따라 시 도지사가 지정하는 시 도지정문화재 및 문화재자료와 문화재청장이 지정하는 국가지정문화재가있다. 국가지정문화재의 보존 관리 정책 중 하나인 정기조사는 문화재보호법에 따라 문화재의 현상, 관리, 수리, 그 밖의 환경보전 상황 등에 관하여 3년 또는 5년 주기로 조사하는 제도로 2006년 문화재보호법에 도입되어 현재까지 해당문화재의 훼손 손상등을 사전에 발견하고 적절한 예방조치를 취하는 등 국가지정문화재의 보존 관리에 기여한 바가 크다. 그런데 2016년 제정된 국가지정문화재 정기조사 운영지침의 일부내용은 국가지정 동산문화재 정기조사 운영에 혼란을 종종 발생시켜 국가지정 동산문화재 정기조사의 체계적 관리 및 품질 제고를 위한 수정과 보완이 필요하다. 이에, 본고는 국가지정문화재 정기조사제도의 체계와 구조, 국가지정 동산문화재 정기조사 운영실태 등을 분석한 후 국가지정 동산문화재 정기조사의 체계적 관리 및 품질 제고를 위하여 국가지정문화재 정기조사 운영지침상의 정기조사 총괄 주관 실시부서 특정, 정기조사 위탁, 정기조사 서식 및 매뉴얼의 개선방안을 제시하였다. 이들 개선방안이 향후 국가지정 동산문화재 정기조사의 품질 제고와 맞춤형 조사 기록체계 구축에 일조되기를 기대한다.

Muller 및 regular falsi 방법에 의한 CMOS 반전 증폭기의 정상상태 해석 (Analysis of CMOS inverter by muller and regular falsi method under the steady-state)

  • 유은상;이은구;김태한;김철성
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1998년도 하계종합학술대회논문집
    • /
    • pp.371-374
    • /
    • 1998
  • 본 논문에서는 muller법과 regular falsi법에 의한 CMOS 반전 증폭 회로를 해석하는 방법을 제안한다. Muller법과 regular falsi법을 이용하여 회로의 절점전압과 branch 전류를 예측하였고 회로의 출력 절점에서 KCL을 만족하도록 하였다. CMOS 반전 증폭 회로의 모의실험을 수행한 결과 MEDICI에 사용된 결합법에 비해 전압특성과 전류특성은 각각 5%와 5.4%의 최대상대오차를 보였다.

  • PDF

중년여성의 규칙적인 자궁경부암 검진 이행관련 요인 (A Study on Regular Cervical Cancer Screening Behavior among Middle-aged Women)

  • 조인숙;박영숙
    • 대한간호학회지
    • /
    • 제34권1호
    • /
    • pp.141-149
    • /
    • 2004
  • Purpose: To identify the status of regular cervical cancer screening practices among middle-aged women, the associations between regular practice and research factors, and the predictive model and factors effecting such behavior was studied. Method: Two hundred women, aged 40 to 60, were selected by convenience in one urban area of Seoul. They were asked about their regular attendance for screening, knowledge of cancer and screening, health belief, health self-determination index and certain personal factors. Result: Approximately 54.5% of the women had periodic screening tests every 6 months to 2 years. Their knowledge of cervical cancer and health belief were at the medium level of each scale, but their health self-determination scores (HSDI) were low. Some influencing factors, and their cancer odds ratio were identified through univariate regression analysis. These variables were included in a predictive model, and this model proved to have enough fit and classification power (83.5%). In this model, the financial state, self-belief and self-determination scores were found to be significant. Conclusion: Middle-age women's intrinsic motivation for healthy behavior was found to be low in those who felt to be in a poor financial state, had higher perceived barriers, lower perceived benefits and a lower prevalence of undergoing regular screening test.

A COMPARATIVE EVALUATION OF THE ESTIMATORS OF THE 2-PARAMETER GENERALIZED PARETO DISTRIBUTION

  • Singh, V.P.;Ahmad, M.;Sherif, M.M.
    • Water Engineering Research
    • /
    • 제4권3호
    • /
    • pp.155-173
    • /
    • 2003
  • Parameters and quantiles of the 2-parameter generalized Pareto distribution were estimated using the methods of regular moments, modified moments, probability weighted moments, linear moments, maximum likelihood, and entropy for Monte Carlo-generated samples. The performance of these seven estimators was statistically compared, with the objective of identifying the most robust estimator. It was found that in general the methods of probability-weighted moments and L-moments performed better than the methods of maximum likelihood estimation, moments and entropy, especially for smaller values of the coefficient of variation and probability of exceedance.

  • PDF

Regular Difference Covers

  • Arasu, K.T.;Bhandari, Ashwani K.;Ma, Siu-Lun;Sehgal, Surinder
    • Kyungpook Mathematical Journal
    • /
    • 제45권1호
    • /
    • pp.137-152
    • /
    • 2005
  • We introduce the concept of what we call "regular difference covers" and prove many nonexistence results and provide some new constructions. Although the techniques employed mirror those used to investigate difference sets, the end results in this new setting are quite different.

  • PDF

EDGE-MINIMIZATION OF NON-DETERMINISTIC FINITE AUTOMATA

  • Melnikov, B.F.;Melnikova, A.A.
    • Journal of applied mathematics & informatics
    • /
    • 제8권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.

SOME PROPERTIES OF THE BASIS FINITE AUTOMATON

  • Melnikov, B.F.;Melnikova, A.A.
    • Journal of applied mathematics & informatics
    • /
    • 제9권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.