Languages accepted by weighted restarting automata

DOI10.3233/FI-2021-2038MaRDI QIDQ5164872zbMATH OpenOpenAlexFDO

Authors 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

semiringclosure propertiesnon-forgetting restarting automatarelative acceptance conditionweighted restarting automata

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Weighted restarting automata as language acceptors
• Weighted restarting automata
• Weighted Restarting Automata and Pushdown Relations
• Weighted restarting automata and pushdown relations
• Hierarchies of weakly monotone restarting automata

Cites work

• scientific article; zbMATH DE number 1394484 (Why is no real title available?)
• scientific article; zbMATH DE number 2245557 (Why is no real title available?)
• Formal Languages and Groups as Memory
• Machines, Computations, and Universality
• ON THE POWER OF RRWW-AUTOMATA
• Observation of string-rewriting systems
• On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone
• Recent advances in formal languages and applications.
• The Complexity of Enumeration and Reliability Problems
• Weighted Restarting Automata and Pushdown Relations
• Weighted restarting automata
• Weighted restarting automata and pushdown relations
• Weighted restarting automata as language acceptors

Cited in

(5)

• Relative approximate bisimulations for fuzzy picture automata
• Weighted restarting automata and pushdown relations
• scientific article; zbMATH DE number 1408339 (Why is no real title available?)
• Weighted restarting automata
• Weighted restarting automata as language acceptors

This page was built for publication: Languages accepted by weighted restarting automata

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