A Generalised Twinning Property for Minimisation of Cost Register Automata
- Submitting institution
-
City, University of London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 807
- Type
- E - Conference contribution
- DOI
-
10.1145/2933575.2934549
- Title of conference / published proceedings
- LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
- First page
- 857
- Volume
- -
- Issue
- -
- ISSN
- 1043-6871
- Open access status
- Deposit exception
- Month of publication
- July
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 11
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- String-to-string transducers and cost register automata were introduced by Alur (CAV Award 2008, Alonzo-Church Award 2016) in 2008, yielding since then many works on the topic. This paper is significant as it characterises the size of these models providing efficient procedures for minimisation and faster running time for verification algorithms. Underway generalisation to trees by a German team (QuantLA, Dresden - Leipzig).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -