<学術雑誌論文>
Implementation of Haskell modules for automata and Sticker systems

作成者
本文言語
出版者
発行日
収録物名
開始ページ
終了ページ
出版タイプ
アクセス権
関連DOI
関連DOI
関連URI
関連情報
概要 We realized operations appeared in the theory of automata using Haskell languages. Using the benefits of functions of lazy evaluations in Haskell, we can express a language set which contains infinite... elements as concrete functional notations like mathematical notations. Our modules can be used not only for analyzing the properties about automata and their application systems but also for self study materials or a tutorial to learn automata, grammar and language theories. We also implemented the modules for sticker systems. Paun and Rozenberg explained a concrete method to transform an automaton to a sticker system in 1998. We modified their definitions and improved their insufficient results. Using our module functions, we can easily define finite automata and linear grammars and construct sticker systems which have the same power of finite automata and linear grammars.続きを見る

本文ファイル

pdf JMI2009A-7 pdf 200 KB 216  

詳細

レコードID
査読有無
主題
注記
タイプ
登録日 2009.10.20
更新日 2020.10.26

この資料を見た人はこんな資料も見ています