Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Learning of Finite Coded Petri Net Languages

S. Kannamma1, D.G. Thomas2, K. Rangarajan
1Department of Mathematics, S.D.N.B. Vaishnav College for Women Chennai – 600 044.
2Department of Mathematics, Madras Christian College Chennai – 600 059.
  • Published: 30/11/2008

Abstract

We present a class of Coded Petri net languages and study some algebraic properties. The purpose of introduction of this language is to bring out its usefulness in learning theory. We introduce an algorithm for learning a finite coded Petri net language and its running time is bounded by a polynomial function of given inputs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
S. Kannamma, D.G. Thomas, K. Rangarajan. Learning of Finite Coded Petri Net Languages[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 067. 223-234. DOI: .