Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy

DOI10.3233/FI-2015-1196zbMath1342.68187OpenAlexW1752758878MaRDI QIDQ2805444

Takashi Yokomori, Fumiya Okubo

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1196

zbMATH Keywords

finite automatacomputation powerChomsky hierarchy of languagesmultiset memory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Decomposition and factorization of chemical reaction transducers ⋮ Theory of reaction automata: a survey

This page was built for publication: Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy