Place Dependency of a Petri Net Generating a Maximal Prefix Code (Algorithmic and Computational Theory in Algebra and Languages)
スポンサーリンク
概要
著者
関連論文
- Some Combinatorial Properties of Extractable Codes (Algebras, Languages, Algorithms in Algebraic Systems and Computations)
- Remarks on extractable submonoids (代数系アルゴリズムと言語および計算理論--RIMS研究集会報告集)
- ペトリネットが生成する極大プレフィクスコードの性質について
- A-12-1 ペトリネットが生成する極大プレフィクスコードについて(A-12.コンカレント工学,基礎・境界)
- A remark on construction of circular codes (Algorithmic and Computational Theory in Algebra and Languages)
- Place Dependency of a Petri Net Generating a Maximal Prefix Code (Algorithmic and Computational Theory in Algebra and Languages)
- A Context Sensitive Grammer generating the set of all primitive words(Algebras, Languages, Computations and their Applications)
- An Extension of Automorphisms of a Petri Net (Algebras, Languages, Algorithms and Computations)