Presentation 2013-07-25
Finite State Automata Representing Character Appearance and Disappearance by Character Encoding Scheme Conversion
Seikoh NISHITA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Character encoding conversion involves character appearance and disappearance problem: the conver- sion sometimes creates extra characters that do not exist in original strings, and sometimes eliminates characters that exist in original strings. To address the problem, this paper formalizes the encoding conversion with finite state transducers, and presents a method to develop a finite state transducer from an actual encoding converter. Moreover, this paper proposes a checker for unexpected transformation of characters represented by a finite state acceptor, and reports an experimental result for the checker.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Coded character set / character encoding scheme / finite state acceptor / finite state transducer
Paper # SS2013-20,KBSE2013-20
Date of Issue

Conference Information
Committee KBSE
Conference Date 2013/7/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Knowledge-Based Software Engineering (KBSE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Finite State Automata Representing Character Appearance and Disappearance by Character Encoding Scheme Conversion
Sub Title (in English)
Keyword(1) Coded character set
Keyword(2) character encoding scheme
Keyword(3) finite state acceptor
Keyword(4) finite state transducer
1st Author's Name Seikoh NISHITA
1st Author's Affiliation Faculty of Engineering, Takushoku University()
Date 2013-07-25
Paper # SS2013-20,KBSE2013-20
Volume (vol) vol.113
Number (no) 160
Page pp.pp.-
#Pages 6
Date of Issue