Some Petri Net Languages and Codes

  • Authors:
  • Masami Ito;Yoshiyuki Kunimoch

  • Affiliations:
  • -;-

  • Venue:
  • DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we consider the language over an alphabet T generated by a given Petri net with a positive initial marking, called a CPN language. This language becomes a prefix code over T. We are interested in CPN languages which are maximal prefix codes, called mCPN languages over T. We will investigate various properties of mCPN languages. Moreover, we will prove that a CPN language is a context-sensitive language in two different ways.