Quantitative semantics for jumping automata

DOI10.46298/LMCS-21(4:31)2025MaRDI QIDQ6858420zbMATH OpenFDO

Authors Shaull Almagor, Neta Dafni, Ishai Salgado

Publication date 13 February 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-21(4:31)2025

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A normalized edit distance on infinite words
• Affine Parikh automata
• Bounded Parikh automata
• Characterization and complexity results on jumping finite automata
• Handbook of weighted automata
• scientific article; zbMATH DE number 1962763 (Why is no real title available?)
• scientific article; zbMATH DE number 2038747 (Why is no real title available?)
• scientific article; zbMATH DE number 2146477 (Why is no real title available?)
• scientific article; zbMATH DE number 7830359 (Why is no real title available?)
• Jumping automata must pay
• Jumping automata over Infinite words
• Jumping finite automata
• Jumping finite automata: characterizations and complexity
• Limitedness theorem on finite automata with distance functions
• Max and sum semantics for alternating weighted automata
• On basic properties of jumping finite automata
• Operational State Complexity under Parikh Equivalence
• Parikh automata over Infinite words
• Process symmetry in probabilistic transducers
• Quantitative languages
• Quantitative semantics for jumping automata
• Quantitative vs. weighted automata
• The limitedness problem on distance automata: Hashiguchi's method revisited
• Two-way deterministic automata with jumping mode

Cited in

(1)

• Quantitative semantics for jumping automata

This page was built for publication: Quantitative semantics for jumping automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858420)