A hierarchy of jumping restarting automata

DOI10.1016/J.INS.2023.119981OpenAlexW4389373644MaRDI QIDQ6180004FDOQ6180004

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

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

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)

Cites Work

• Title not available (Why is that?)
• Growing context-sensitive languages and Church-Rosser languages
• Weighted restarting automata and pushdown relations
• Weighted Restarting Automata and Pushdown Relations
• Title not available (Why is that?)
• Restarting automata
• A hierarchy of monotone deterministic non-forgetting restarting automata
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Restarting automata, Church-Rosser languages, and representations of {r. e. \ }languages
• Title not available (Why is that?)
• Jumping finite automata
• Weighted restarting automata
• Operational state complexity and decidability of jumping finite automata

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)