Parikh's theorem for infinite alphabets

We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this setting by allowing for orbit-finite unions instead of only finite ones. We prove that commutative images of languages of one-register automata...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 13
Hlavní autori: Hofman, Piotr, Juzepczuk, Marta, Lasota, Slawomir, Pattathurajan, Mohnish
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 29.06.2021
Predmet:
Automata
Computer science
Grammar
Image recognition
Orbits
Registers
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this setting by allowing for orbit-finite unions instead of only finite ones. We prove that commutative images of languages of one-register automata are not always semi-linear, but they are always rational. We also lift the latter result to grammars: commutative images of one- register context-free languages are rational, and in consequence commutatively equivalent to register automata. We conjecture analogous results for automata and grammars with arbitrarily many registers.
DOI:10.1109/LICS52264.2021.9470626