Languages Accepted by Weighted Restarting Automata*

DOI10.3233/FI-2021-2038OpenAlexW3163565608MaRDI QIDQ5164872

Qichao Wang

Publication date: 15 November 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2021-2038

zbMATH Keywords

closure propertiessemiringnon-forgetting restarting automatarelative acceptance conditionweighted restarting automata

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted restarting automata and pushdown relations
• Weighted restarting automata
• Recent advances in formal languages and applications.
• Weighted Restarting Automata as Language Acceptors
• Weighted Restarting Automata and Pushdown Relations
• On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone
• Formal Languages and Groups as Memory
• The Complexity of Enumeration and Reliability Problems
• ON THE POWER OF RRWW-AUTOMATA
• Machines, Computations, and Universality

This page was built for publication: Languages Accepted by Weighted Restarting Automata*