A hierarchy of jumping restarting automata

DOI10.1016/j.ins.2023.119981OpenAlexW4389373644MaRDI QIDQ6180004

No author found.

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

degreehierarchyrestarting automatonjumping automaton

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted restarting automata and pushdown relations
• A hierarchy of monotone deterministic non-forgetting restarting automata
• Growing context-sensitive languages and Church-Rosser languages
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Weighted restarting automata
• Weighted Restarting Automata and Pushdown Relations
• JUMPING FINITE AUTOMATA
• Restarting automata
• Operational State Complexity and Decidability of Jumping Finite Automata

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