Author(s)： K.K.K.R.Perera and Yoshihiro Mizoguchi

J. Math-for-Ind. 1A (2009) 51-56.

• File： JMI2009A-7.pdf (142KB)

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.

Keyword(s).　 Automata, Language, Sticker System, DNA Computing, Haskell