@inproceedings{https___doi.org_10.4230_lipics.mfcs.2025.14,
    doi = {10.4230/lipics.mfcs.2025.14},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.14},
    author = {Balachander, Mrudula and Filiot, Emmanuel and Gentilini, Raffaella and Tzevelekos, Nikos},
    keywords = {Register automata, data words, equivalence, minimization, active learning, Theory of computation → Formal languages and automata theory},
    language = {en},
    title = {Register Automata with Permutations},
    publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
    year = {2025},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2025-8-24 7:21:35 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.mfcs.2025.14, doi = {10.4230/lipics.mfcs.2025.14}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.14}, author = {Balachander, Mrudula and Filiot, Emmanuel and Gentilini, Raffaella and Tzevelekos, Nikos}, keywords = {Register automata, data words, equivalence, minimization, active learning, Theory of computation → Formal languages and automata theory}, language = {en}, title = {Register Automata with Permutations}, publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, year = {2025}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2025-8-24 7:21:35 +0100} }