Finite automata with multiset memory: a new characterization of Chomsky hierarchy

DOI10.3233/FI-2015-1196zbMATH Open1342.68187OpenAlexW1752758878MaRDI QIDQ2805444FDOQ2805444

Authors: Fumiya Okubo, Takashi Yokomori 

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

Recommendations

• An automata-theoretic characterization of the Chomsky-hierarchy
• Self-modifying finite automata: An introduction
• scientific article; zbMATH DE number 2080936
• scientific article; zbMATH DE number 5593273
• Morphic characterizations of languages in Chomsky hierarchy with insertion and locality

zbMATH Keywords

finite automatacomputation powerChomsky hierarchy of languagesmultiset memory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (6)

• Multi-island finite automata and their even computation.
• Theory of reaction automata: a survey
• Decomposition and factorization of chemical reaction transducers
• Chomskian hierarchies of families of sets of piecewise continuous functions
• Title not available (Why is that?)
• An automata-theoretic characterization of the Chomsky-hierarchy

This page was built for publication: Finite automata with multiset memory: a new characterization of Chomsky hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805444)