Robustness analysis of string transducers

DOI10.1007/978-3-319-02444-8_30zbMATH Open1410.68210OpenAlexW2278079988MaRDI QIDQ5166704FDOQ5166704

Authors Roopsha Samanta, Jyotirmoy V. Deshmukh, Swarat Chaudhuri

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02444-8_30

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Lipschitz robustness of finite-state transducers
• On reversible transducers
• Expressiveness of streaming string transducers
• Aperiodic string transducers
• Transducers with Origin Information

Cited in

(9)

• Robustness analysis of networked systems
• Robustness of the decomposition functional for a sequence of symbols in a given dictionary of standard fragments
• On tolerance of discrete systems with respect to transition perturbations
• Safe environmental envelopes of discrete systems
• Specifiable robustness in reactive synthesis
• scientific article; zbMATH DE number 7559473 (Why is no real title available?)
• Lipschitz robustness of finite-state transducers
• Minimal synthesis of string to string functions from examples
• The many facets of string transducers (invited talk)

This page was built for publication: Robustness analysis of string transducers

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