Loading...
Please wait, while we are loading the content...
Similar Documents
Implementation of haskell modules for automata and sticker systems (2009).
| Content Provider | CiteSeerX |
|---|---|
| Author | F案, D. 案 E. 案 Perera, K. K. K. R. Mizoguchi, Yoshihiro |
| Abstract | Abstract. 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. |
| File Format | |
| Publisher Date | 2009-01-01 |
| Access Restriction | Open |
| Subject Keyword | Sticker System Haskell Module Finite Automaton Linear Grammar Language Theory Application System Construct Sticker System Self Study Material Infinite Element Concrete Functional Notation Module Function Concrete Method Insufficient Result Mathematical Notation Haskell Language Lazy Evaluation |
| Content Type | Text |
| Resource Type | Article |
