Languages Accepted by Weighted Restarting Automata*

DOI10.3233/FI-2021-2038OpenAlexW3163565608MaRDI QIDQ5164872FDOQ5164872

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)

Cites Work

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

Cited In (2)

• Relative approximate bisimulations for fuzzy picture automata
• Title not available (Why is that?)

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)