Approximate comparison of functions computed by distance automata
From MaRDI portal
Publication:290904
DOI10.1007/S00224-015-9643-3zbMATH Open1341.68123OpenAlexW871449085MaRDI QIDQ290904FDOQ290904
Authors: Thomas Colcombet, Laure Daviaud 
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
Recommendations
Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Cites Work
- On semigroups of matrices over the tropical semiring
- On the definition of a family of automata
- 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
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Title not available (Why is that?)
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Distance desert automata and the star height problem
Cited In (5)
- Comparison of max-plus automata and joint spectral radius of tropical matrices
- Deriving generic bounds for time-series constraints based on regular expressions characteristics
- Title not available (Why is that?)
- Approximate comparison of distance automata
- Distance automata having large finite distance or finite ambiguity
This page was built for publication: Approximate comparison of functions computed by distance automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290904)
