Quantitative Languages Defined by Functional Automata

DOI10.1007/978-3-642-32940-1_11zbMath1364.68250arXiv1111.0862OpenAlexW1852784691MaRDI QIDQ5891775

Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.0862

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Weight Assignment Logic ⋮ Parameterized Weighted Containment ⋮ A note on the approximation of mean-payoff games ⋮ Sequentiality of group-weighted tree automata ⋮ Multi-weighted automata and MSO logic ⋮ Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs

This page was built for publication: Quantitative Languages Defined by Functional Automata