Weighted restarting automata

DOI10.1007/s00500-016-2164-4zbMath1398.68325OpenAlexW2363997898MaRDI QIDQ1797778

Friedrich Otto, Qichao Wang

Publication date: 22 October 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-016-2164-4

zbMATH Keywords

upper boundweight functionsemiringclosure propertyrestarting automaton

Mathematics Subject Classification ID

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

Related Items (3)

A hierarchy of jumping restarting automata ⋮ Languages Accepted by Weighted Restarting Automata* ⋮ Weighted Restarting Automata as Language Acceptors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Membership for growing context-sensitive grammars is polynomial
• Handbook of weighted automata
• Characterizing the Rational Functions by Restarting Transducers
• The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable
• Probabilistic Weighted Automata
• WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS
• On the definition of a family of automata
• Pebble Weighted Automata and Transitive Closure Logics
• The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
• Church-Rosser Thue systems and formal languages
• Restarting automata
• Semirings and Formal Power Series

This page was built for publication: Weighted restarting automata