http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Sciarini Guryanova, N.V. (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
POSSIBLE EDGES OF A FINITE AUTOMATON DEFINING A GIVEN REGULAR LANGUAGE
Boris Melnikov,Natalia Sciarini-Guryanova 한국전산응용수학회 2002 Journal of applied mathematics & informatics Vol.9 No.2
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. 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.
-
POSSIBLE EDGES OF A FINITE AUTOMATON DEFINING A GIVEN REGULAR LANGUAGE
Melnikov, B.F.,Sciarini Guryanova, N.V. 한국전산응용수학회 2002 The Korean journal of computational & applied math Vol.9 No.2
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.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
