Weighted Restarting Automata as Language Acceptors

DOI10.1007/978-3-319-40946-7_25zbMath1475.68168OpenAlexW2490205786MaRDI QIDQ2830229

Friedrich Otto, Qichao Wang

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_25

zbMATH Keywords

closure propertyweighted restarting automatonlanguage classnon-forgetting restarting automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (2)

Weighted restarting automata and pushdown relations ⋮ Languages Accepted by Weighted Restarting Automata*

Cites Work

• Unnamed Item
• Unnamed Item
• Weighted restarting automata
• Weighted Restarting Automata and Pushdown Relations
• COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA
• On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone
• Strictly Deterministic CD-Systems of Restarting Automata

This page was built for publication: Weighted Restarting Automata as Language Acceptors