Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

THE POWER OF PROGRAMMED GRAMMARS WITH GRAPHS FROM VARIOUS CLASSES

  • Barbaiani Madalina (Research Group on Mathematical Linguistics, Rovira i Virgili University) ;
  • Bibire Cristina (Research Group on Mathematical Linguistics, Rovira i Virgili University) ;
  • Dassow Jurgen (Fakultat fur Informatik, Otto-von-Guericke-Universitat Magdeburg) ;
  • Delaney Aidan (Research Group on Mathematical Linguistics, Rovira i Virgili University) ;
  • Fazekas Szilard (Research Group on Mathematical Linguistics, Rovira i Virgili University) ;
  • Ionescu Mihai (Research Group on Mathematical Linguistics, Rovira i Virgili University) ;
  • Liu Guangwu (Research Group on Mathematical Linguistics, Rovira i Virgili University) ;
  • Lodhi Atif (Research Group on Mathematical Linguistics, Rovira i Virgili University) ;
  • Nagy Benedek (Research Group on Mathematical Linguistics, Rovira i Virgili University)
  • 발행 : 2006.09.01

⟨ 이전 논문 다음 논문 ⟩

초록

Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamiltonian, planar and bipartite graphs and regular graphs of degree at least three are pr-universal in that sense that any language which can be generated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underlying graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages.

키워드