A hierarchy of jumping restarting automata

DOI10.1016/J.INS.2023.119981MaRDI QIDQ6180004zbMATH OpenOpenAlexFDO

Authors

Publication date 18 January 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2023.119981

zbMATH Keywords

hierarchydegreerestarting automatonjumping automaton

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX) Computer science (68-XX)

Recommendations

• scientific article; zbMATH DE number 2040896
• scientific article; zbMATH DE number 1747447
• Restarting automata with restricted utilization of auxiliary symbols
• Restarting Tree Automata
• Degrees of non-monotonicity for restarting automata

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1394484 (Why is no real title available?)
• scientific article; zbMATH DE number 2245557 (Why is no real title available?)
• A hierarchy of monotone deterministic non-forgetting restarting automata
• Growing context-sensitive languages and Church-Rosser languages
• Jumping finite automata
• Operational state complexity and decidability of jumping finite automata
• Restarting automata
• Restarting automata, Church-Rosser languages, and representations of {r. e. \ }languages
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Weighted Restarting Automata and Pushdown Relations
• Weighted restarting automata
• Weighted restarting automata and pushdown relations

This page was built for publication: A hierarchy of jumping restarting automata

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