### 抜粋

This paper concerns new characterizations of language classes in the Chomsky hierarchy in terms of a new type of computing device called FAMM (Finite Automaton with Multiset Memory) in which a multiset of symbol objects is available for the storage of working space. Unlike the stack or the tape for a storage, the multiset might seem to be less powerful in computing task, due to the lack of positional (structural) information of stored data. We introduce the class of FAMMs of degree d (for non-negative integer d) in general form, and investigate the computing powers of some subclasses of those FAMMs. We show that the classes of languages accepted by FAMMs of degree 0, by FAMMs of degree 1, by exponentially-bounded FAMMs of degree 2, and by FAMMs of degree 2 are exactly the four classes of languages REG, CF, CS and RE in the Chomsky hierarchy, respectively. Thus, this unified view from multiset-based computing provides new insight into the computational aspects of the Chomsky hierarchy.

元の言語 | English |
---|---|

ページ（範囲） | 31-44 |

ページ数 | 14 |

ジャーナル | Fundamenta Informaticae |

巻 | 138 |

発行部数 | 1-2 |

DOI | |

出版物ステータス | Published - 2015 |

### ASJC Scopus subject areas

- Information Systems
- Computational Theory and Mathematics
- Theoretical Computer Science
- Algebra and Number Theory

## フィンガープリント Finite automata with multiset memory: A new characterization of chomsky hierarchy' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*Fundamenta Informaticae*,

*138*(1-2), 31-44. https://doi.org/10.3233/FI-2015-1196