Approximate comparison of functions computed by distance automata

DOI10.1007/s00224-015-9643-3zbMath1341.68123OpenAlexW871449085MaRDI QIDQ290904

Laure Daviaud, Thomas Colcombet

Publication date: 3 June 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://openaccess.city.ac.uk/id/eprint/21296/1/version_journal_v3.pdf

zbMATH Keywords

comparisonasymptotic behaviourweighted automatatropical semiringdistance automata

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Related Items (1)

Deriving generic bounds for time-series constraints based on regular expressions characteristics

Cites Work

• Unnamed Item
• Limitedness theorem on finite automata with distance functions
• On the topological structure of a finitely generated semigroup of matrices
• The limitedness problem on distance automata: Hashiguchi's method revisited
• Green’s Relations and Their Use in Automata Theory
• On the definition of a family of automata
• The Theory of Stabilisation Monoids and Regular Cost Functions
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• On semigroups of matrices over the tropical semiring
• Distance desert automata and the star height problem

This page was built for publication: Approximate comparison of functions computed by distance automata