DocumentCode
582960
Title
Rewriting Cyclic Normal Automata and Their Applications
Author
Dimlo, U.M.F. ; Vemuganti, Yashaswi ; Rajan, E.G.
Author_Institution
Anna Univ. Coimbatore, Coimbatore, India
fYear
2012
fDate
14-15 Sept. 2012
Firstpage
47
Lastpage
51
Abstract
This paper introduces novel concepts like rewriting cyclic normal automata and flower automata. The principle of normalization of automata states that for any given automaton belonging to a family of automata one can construct a equivalent rewriting cyclic normal automaton.
Keywords
automata theory; rewriting systems; automata state normalization; flower automata; rewriting cyclic normal automata; Algorithm design and analysis; Automata; Companies; Educational institutions; Publishing; Signal processing; Signal processing algorithms; Green´s relations; automata; formal languages; normalization of automata;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing Sciences (ICCS), 2012 International Conference on
Conference_Location
Phagwara
Print_ISBN
978-1-4673-2647-6
Type
conf
DOI
10.1109/ICCS.2012.63
Filename
6391645
Link To Document