현재 위치
Home
Enhancement of Turing Machine to Universal Turing Machine to Halt for Recursive Enumerable Language and its JFLAP Simulation
-
- 발행기관
- 보안공학연구지원센터(IJHIT) 바로가기
-
- 간행물
- International Journal of Hybrid Information Technology 바로가기
-
- 통권
- Vol.8 No.1 (2015.01)바로가기
-
- 페이지
- pp.193-202
-
- 저자
-
- 언어
- 영어(ENG)
-
- URL
- https://www.earticle.net/Article/A239245
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
- 영어
- Turing Machines are the most powerful computational machines. Turing machines are similar to algorithms, and are the theoretical basis for real computers. It is a tiresome task to build and maintain Turing Machines for all the problems. The Solution of this problem is The Universal Turing Machine (UTM) or simply a universal machine. The Formation of UTM is very difficult due to the fundamental complexities. There are so many existing tool those does not supporting formation of Universal Turing Machine that’s why it is very difficult to accomplish the task. So that JFLAP platform is used for the creation of UTM. JFLAP is wrapping up of graphical tools that are used as an assist in learning basics of formal languages and automata theory. It is software to perform experiment using formal languages topics covered Nondeterministic finite automata, L-systems, parsing, multi-tape Turing machines, different kind of grammars and Nondeterministic Pushdown automata. As well as testing and making another example for these, JFLAP provide one to research with construction proofs from one form to another, such as converting an NFA to a DFA to a minimal state DFA to a regular expression or regular grammar. A Directed graph is be used to represent a Turing Machine, uses by JFLAP. It is widely used to simulate UTM as transducer of the Turing machine and it consists of multiple inputs.
목차
Abstract
1. Introduction
2. Universal Turing Machine in JFLAP
2.1. Universal Turing Machine
2.2. Working of the UTM
2.3. Simulation of Turing Machines in the UTM
2.4. Creation of input for the UTM
2.5. Manipulation of Turing Machine in the UTM
3. Literature Survey
4. Existing System
5. Proposed System
6. Result and Discussion
6.1. Transitions from Final States
7. Conclusion and Future Work
References
키워드
Turing Machine FSM UTM CFG PDA JFLAP Recursive Enumerable grammar저자
간행물 정보
발행기관
-
- 발행기관명
- 보안공학연구지원센터(IJHIT) [Science & Engineering Research Support Center, Republic of Korea(IJHIT)]
- 설립연도
- 2006
- 분야
- 공학>컴퓨터학
- 소개
- 1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업
간행물
-
- 간행물명
- International Journal of Hybrid Information Technology
- 간기
- 격월간
- pISSN
- 1738-9968
- 수록기간
- 2008~2016
- 십진분류
- KDC 505 DDC 605
이 권호 내 다른 논문 / International Journal of Hybrid Information Technology Vol.8 No.1
피인용수 : 0건 (자료제공 : 네이버학술정보)
함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.
출처 : 네이버학술정보
0개의 논문이 장바구니에 담겼습니다.