Automata Resulting From Graph Operations

被引：0
作者：
Julie, J. [1 ]
Babujee, J. Baskar [2 ]
机构：
[1] Anna Univ, Madras 25, Tamil Nadu, India
[2] Anna Univ, Dept Math, Chennai 25, India
来源：
2012 FOURTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING (ICOAC) | 2012年
关键词：
Paths; cycles; automata; regular expression; languages; reactive automata; PRODUCT;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The binary operations like Cartesian products, normal and lexicographic products on graphs have played a vital role in graph construction. An insight of automata as directed graphs motivated us to study some of these products on these abstract machines. In this paper we operate normal and lexicographic products over automata and analyze the language recognized by these resultant automata. It is observed that the Generalized Parikh vectors of the language of the resultant automata are a family of parallel lines in the two dimensional plane. The lexicographic product of path automata appears as a neural network after a few modifications using reactive automata.
引用
收藏
页数：6
相关论文
共 15 条
  • [1] [Anonymous], 1958, PACIFIC J MATH
  • [2] Baskar Babujee J., 2008, ACTA CIENCIA INDIC M, Vxxxiv, P705
  • [3] Baskar Babujee J., 2007, INT J MATH COMPUTER, V2, P163
  • [4] Baskar Babujee J., 2011, P INT C MATH COMPUTE, P135
  • [5] BERSTEL J, 2010, J INFORM COMPUTATION, V208, P1258, DOI DOI 10.1016/J.IC.2010.06.002
  • [6] CROCHEMORE M, 2011, REACTIVE AUTOMATA IN, V209, P692, DOI DOI 10.1016/J.IC.2011.01.002
  • [7] BOOLEAN OPERATIONS ON GRAPHS
    HARARY, F
    WILCOX, GW
    [J]. MATHEMATICA SCANDINAVICA, 1967, 20 (01) : 41 - &
  • [8] HOPCROFT JE, 1987, INTRO AUTOMATA THEOR
  • [9] Julie J., 2012, EUR J SCI RES, V90, P289
  • [10] Parthasarathy K.R., 1994, Basic Graph Theory
12