http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Melnikova, A.A. (검색결과 3 건)
- 무료
- 기관 내 무료
- 유료
-
Formation of ethnic identity and preservation of the language of indigenous peoples
MELNIKOVA Nadezhda,SCHJETNE Eva Carlsdotter 동북아시아문화학회 2018 동북아시아문화학회 국제학술대회 발표자료집 Vol.2018 No.07
Studying in relations and language and ethnic identity has a long tradition in social psychology. Beginning with the work of M. Lazarus, H. Steinthal, W. Wundt and, A.A. Potebnya language is seen as one of the most important factors of ethnic identity. The study we conducted revealed the ambiguous role of language in the formation and preservation of ethnic identity among the of the indigenous people who live in a multicultural environment and are adjacent to numerically predominant ethnic groups (Russians, Sakha). It is shown that ethnic identity in modern Evenks and Yukagirs is associated with such factors as lifestyle, customs, traditions, folklor. Respondents who have a clear ethnic identity but do not speak the language have a positive attitude toward learning the language. However, the language is more connected with the past than with the present, and in the modern world its use is associated with ethnic holidays, culture, traditions.
-
EDGE-MINIMIZATION OF NON-DETERMINISTIC FINITE AUTOMATA
Melnikov, B.F.,Melnikova, A.A. 한국전산응용수학회 2001 The Korean journal of computational & applied math Vol.8 No.3
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. AMS Mathematics Subject Classification : 68Q45
-
SOME PROPERTIES OF THE BASIS FINITE AUTOMATON
Melnikov, B.F.,Melnikova, A.A. 한국전산응용수학회 2002 The Korean journal of computational & applied math Vol.9 No.1
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.
DBpia
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
