Finite Orbits of Language Operations

Autor: Charlier, E., Domaratzki, M., Harju, T., Shallit, J.

We consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. This generalizes previous results about complement, Kleene closure, and

Externí odkaz: http://arxiv.org/abs/1101.1667

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

P2.11-10 Discovery of Potential Biomarkers That Discriminate Early Stage NSCLC from Controls by Non-Targeted Metabolomics Profiling

Autor: Kim, J., Balshaw, R., Trevena, C., Banerji, S., Murphy, L., Dawe, D., Tan, L., Srinathan, S., Buduhan, G., Kidane, B., Qing, G., Domaratzki, M., Aliani, M.

Publikováno v: In Journal of Thoracic Oncology October 2019 14(10) Supplement:S795-S796

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Finding finite automata that certify termination of string rewriting

Autor: Geser, A., Hofbauer, D., Waldmann, J., Zantema, H., Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S.

Publikováno v: Implementation and Application of Automata (Revised Selected Papers, Ninth International Conference, CIAA 2004, Kingston ON, Canada, July 22-24, 2004), 134-145
STARTPAGE=134;ENDPAGE=145;TITLE=Implementation and Application of Automata (Revised Selected Papers, Ninth International Conference, CIAA 2004, Kingston ON, Canada, July 22-24, 2004)
Implementation and Application of Automata ISBN: 9783540243182
CIAA

We present a technique based on the construction of finite automata to prove termination of string rewriting systems. Using this technique the tools Matchbox and TORPA are able to prove termination of particular string rewriting systems completely au

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b109650bcbad2c7f76bd6421c016fe40
https://research.tue.nl/en/publications/1cd8d964-945d-4f8d-ac4b-389942d97812