מושגי ליבה
Lasso languages can be rational, leading to a Kleene theorem for ω-languages.
תקציר
The content introduces automata operating on pairs of words to capture regular ω-languages. It discusses lasso languages, their connection to rational expressions, and the construction of lasso automata using Brzozowski derivatives. The goal is to establish a Kleene theorem for lasso languages and explore their relationship with ω-expressions.
Introduction to lassos in the study of ω-automata.
Representation of ultimately periodic words by lassos.
Connection between regular ω-languages and ultimately periodic words.
Construction of rational lasso languages from rational expressions.
Development of a Kleene theorem for lasso languages with respect to lasso automata.
Exploration of the relationship between rational lasso and ω-expressions.
Establishment of a Kleene theorem for ω-languages with saturated lasso automata.
The paper is organized into sections covering preliminaries, rational lasso expressions, regularity of lasso languages, and the construction of Brzozowski lasso automaton. Key concepts include equivalence relations, derivatives, disjunctive forms, and soundness proofs.
סטטיסטיקה
rational lasso lang. 5.7 [4]
regular lasso lang. 4.14 [4]
rational ω-lang. 5.4, 5.6 [4]
regular ω-lang. 6.15, 6.16 [4]