Name
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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-46011-X_6 | Developments in Language Theory |
Keywords | Field | DocType |
various property,different way,mcpn language,cpn language,prefix code,context-sensitive language,maximal prefix code,petri net | Context-sensitive language,Petri net,Programming language,Computer science,Prefix,Prefix code,Alphabet | Conference |
Volume | ISSN | ISBN |
2295 | 0302-9743 | 3-540-43453-4 |
Citations | PageRank | References |
1 | 0.43 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masami Ito | 1 | 299 | 66.19 |
| Yoshiyuki Kunimoch | 2 | 1 | 0.43 |