@inproceedings{55795f3b7bc845318c9de17ee770fc07,
title = "Jumping Automata over Infinite Words",
abstract = "Jumping automata are finite automata that read their input in a non-consecutive manner, disregarding the order of the letters in the word. We introduce and study jumping automata over infinite words. Unlike the setting of finite words, which has been well studied, for infinite words it is not clear how words can be reordered. To this end, we consider three semantics: automata that read the infinite word in some order so that no letter is overlooked, automata that can permute the word in windows of a given size k, and automata that can permute the word in windows of an existentially-quantified bound. We study expressiveness, closure properties and algorithmic properties of these models.",
keywords = "Infinite Words, Jumping Automata, Parikh Image",
author = "Shaull Almagor and Omer Yizhaq",
note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 27th International Conference on Developments in Language Theory, DLT 2023 ; Conference date: 12-06-2023 Through 16-06-2023",
year = "2023",
doi = "10.1007/978-3-031-33264-7\_2",
language = "الإنجليزيّة",
isbn = "9783031332630",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "9--22",
editor = "Frank Drewes and Mikhail Volkov",
booktitle = "Developments in Language Theory - 27th International Conference, DLT 2023, Proceedings",
address = "ألمانيا",
}