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

DOI10.3233/FI-2015-1196MaRDI QIDQ2805444zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

finite automatacomputation powerChomsky hierarchy of languagesmultiset memory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cited in

(6)

• Theory of reaction automata: a survey
• Multi-island finite automata and their even computation.
• Decomposition and factorization of chemical reaction transducers
• Chomskian hierarchies of families of sets of piecewise continuous functions
• scientific article; zbMATH DE number 2080936 (Why is no real title available?)
• 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)