Optimal run problem for weighted register automata

DOI10.1016/j.tcs.2020.11.003zbMath1464.68185OpenAlexW4205838184MaRDI QIDQ5919052

Reo Yoshimura, Hiroyuki Seki, Yoshiaki Takata

Publication date: 16 December 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.003

zbMATH Keywords

complexityoptimal runregister typeweighted register automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• Controllers for reachability specifications for hybrid systems
• A theory of timed automata
• Finite-memory automata
• Context-free languages over infinite alphabets
• Intractability of decision problems for finite-memory automata
• Weak cost register automata are still powerful
• Complexity results on register context-free grammars and register tree automata
• Weighted register automata and weighted logic on data words
• A logical characterization of data languages.
• Generalized register context-free grammars
• Regular expressions for data words
• Automata theory in nominal sets
• LTL with the freeze quantifier and register automata
• Two-variable logic on data words
• Weighted Register Automata and Weighted Logic on Data Words
• Regular Functions and Cost Register Automata
• Finite state machines for strings over infinite alphabets
• Hybrid Systems: Computation and Control
• Optimal run problem for weighted register automata

This page was built for publication: Optimal run problem for weighted register automata