Self-modifying finite automata: An introduction

DOI10.1016/0020-0190(95)00157-8MaRDI QIDQ1350286zbMATH OpenOpenAlexFDO

Authors Roy S. Rubinstein, John N. Shutt

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(95)00157-8

zbMATH Keywords

AutomataFormal languagesTheory of computation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Finite automata with multiset memory: a new characterization of Chomsky hierarchy
• Jumping finite automata
• Enhancement of automata with jumping modes
• Finite-memory automata
• Controlled finite automata

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• Self-modifying finite automata: An introduction
• Storage Modification Machines

Cited in

(6)

• Self-modifying finite automata: An introduction
• A note on self-modifying finite automata
• Finite automata with multiset memory: a new characterization of Chomsky hierarchy
• Finite-state registered automata for non-concatenative morphology
• scientific article; zbMATH DE number 88936 (Why is no real title available?)
• SELF-SPECIFYING MACHINES

This page was built for publication: Self-modifying finite automata: An introduction

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