Conecte-se

Bibliografias temáticas / Omega-Regular languages

Literatura científica selecionada sobre o tema "Omega-Regular languages"

Autor: Grafiati

Publicado: 25 de maio de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Índice

Artigos de revistas
Livros
Capítulos de livros
Trabalhos de conferências

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Omega-Regular languages".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "Omega-Regular languages"

1

Angluin, Dana, e Dana Fisman. "Learning regular omega languages". Theoretical Computer Science 650 (outubro de 2016): 57–72. http://dx.doi.org/10.1016/j.tcs.2016.07.031.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Angluin, Dana, e Dana Fisman. "Regular omega-Languages with an Informative Right Congruence". Electronic Proceedings in Theoretical Computer Science 277 (7 de setembro de 2018): 265–79. http://dx.doi.org/10.4204/eptcs.277.19.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Falah, Amin, Shibashis Guha e Ashutosh Trivedi. "Reinforcement Learning for Omega-Regular Specifications on Continuous-Time MDP". Proceedings of the International Conference on Automated Planning and Scheduling 33, n.º 1 (1 de julho de 2023): 578–86. http://dx.doi.org/10.1609/icaps.v33i1.27239.

Texto completo da fonte

Resumo:

Continuous-time Markov decision processes (CTMDPs) are canonical models to express sequential decision-making under dense-time and stochastic environments. When the stochastic evolution of the environment is only available via sampling, model-free reinforcement learning (RL) is the algorithm-of-choice to compute optimal decision sequence. RL, on the other hand, requires the learning objective to be encoded as scalar reward signals. Since doing such translations manually is both tedious and error-prone, a number of techniques have been proposed to translate high-level objectives (expressed in logic or automata formalism) to scalar rewards for discrete-time Markov decision processes. Unfortunately, no automatic translation exists for CTMDPs. We consider CTMDP environments against the learning objectives expressed as omega-regular languages. Omega-regular languages generalize regular languages to infinite-horizon specifications and can express properties given in popular linear-time logic LTL. To accommodate the dense-time nature of CTMDPs, we consider two different semantics of omega-regular objectives: 1) satisfaction semantics where the goal of the learner is to maximize the probability of spending positive time in the good states, and 2) expectation semantics where the goal of the learner is to optimize the long-run expected average time spent in the ''good states'' of the automaton. We present an approach enabling correct translation to scalar reward signals that can be readily used by off-the-shelf RL algorithms for CTMDPs. We demonstrate the effectiveness of the proposed algorithms by evaluating it on some popular CTMDP benchmarks with omega-regular objectives.

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Almeida, J., J. C. Costa e M. Zeitoun. "McCammond’s normal forms for free aperiodic semigroups revisited". LMS Journal of Computation and Mathematics 18, n.º 1 (2015): 130–47. http://dx.doi.org/10.1112/s1461157014000448.

Texto completo da fonte

Resumo:

AbstractThis paper revisits the solution of the word problem for ${\it\omega}$-terms interpreted over finite aperiodic semigroups, obtained by J. McCammond. The original proof of correctness of McCammond’s algorithm, based on normal forms for such terms, uses McCammond’s solution of the word problem for certain Burnside semigroups. In this paper, we establish a new, simpler, correctness proof of McCammond’s algorithm, based on properties of certain regular languages associated with the normal forms. This method leads to new applications.

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Gnatenko, Anton Romanovich, e Vladimir Anatolyevich Zakharov. "On the Model Checking Problem for Some Extension of CTL*". Modeling and Analysis of Information Systems 27, n.º 4 (20 de dezembro de 2020): 428–41. http://dx.doi.org/10.18255/1818-1015-2020-4-428-441.

Texto completo da fonte

Resumo:

Sequential reactive systems include programs and devices that work with two streams of data and convert input streams of data into output streams. Such information processing systems include controllers, device drivers, computer interpreters. The result of the operation of such computing systems are infinite sequences of pairs of events of the request-response type, and, therefore, finite transducers are most often used as formal models for them. The behavior of transducers is represented by binary relations on infinite sequences, and so, traditional applied temporal logics (like HML, LTL, CTL, mu-calculus) are poorly suited as specification languages, since omega-languages, not binary relations on omega-words are used for interpretation of their formulae. To provide temporal logics with the ability to define properties of transformations that characterize the behavior ofreactive systems, we introduced new extensions ofthese logics, which have two distinctive features: 1) temporal operators are parameterized, and languages in the input alphabet oftransducers are used as parameters; 2) languages in the output alphabet oftransducers are used as basic predicates. Previously, we studied the expressive power ofnew extensions Reg-LTL and Reg-CTL ofthe well-known temporal logics oflinear and branching time LTL and CTL, in which it was allowed to use only regular languages for parameterization of temporal operators and basic predicates. We discovered that such a parameterization increases the expressive capabilities oftemporal logic, but preserves the decidability of the model checking problem. For the logics mentioned above, we have developed algorithms for the verification of finite transducers. At the next stage of our research on the new extensions of temporal logic designed for the specification and verification of sequential reactive systems, we studied the verification problem for these systems using the temporal logic Reg-CTL*, which is an extension ofthe Generalized Computational Tree Logics CTL*. In this paper we present an algorithm for checking the satisfiability of Reg-CTL* formulae on models of finite state transducers and show that this problem belongs to the complexity class ExpSpace.

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

CURRIE, JAMES D., NARAD RAMPERSAD e KALLE SAARI. "Suffix conjugates for a class of morphic subshifts". Ergodic Theory and Dynamical Systems 35, n.º 6 (4 de junho de 2014): 1767–82. http://dx.doi.org/10.1017/etds.2014.5.

Texto completo da fonte

Resumo:

Let $A$ be a finite alphabet and $f:~A^{\ast }\rightarrow A^{\ast }$ be a morphism with an iterative fixed point $f^{{\it\omega}}({\it\alpha})$, where ${\it\alpha}\in A$. Consider the subshift $({\mathcal{X}},T)$, where ${\mathcal{X}}$ is the shift orbit closure of $f^{{\it\omega}}({\it\alpha})$ and $T:~{\mathcal{X}}\rightarrow {\mathcal{X}}$ is the shift map. Let $S$ be a finite alphabet that is in bijective correspondence via a mapping $c$ with the set of non-empty suffixes of the images $f(a)$ for $a\in A$. Let ${\mathcal{S}}\subset S^{\mathbb{N}}$ be the set of infinite words $\mathbf{s}=(s_{n})_{n\geq 0}$ such that ${\it\pi}(\mathbf{s}):=c(s_{0})f(c(s_{1}))f^{2}(c(s_{2}))\cdots \in {\mathcal{X}}$. We show that if $f$ is primitive, $f^{{\it\omega}}({\it\alpha})$ is aperiodic, and $f(A)$ is a suffix code, then there exists a mapping $H:~{\mathcal{S}}\rightarrow {\mathcal{S}}$ such that $({\mathcal{S}},H)$ is a topological dynamical system and ${\it\pi}:~({\mathcal{S}},H)\rightarrow ({\mathcal{X}},T)$ is a conjugacy; we call $({\mathcal{S}},H)$ the suffix conjugate of $({\mathcal{X}},T)$. In the special case where $f$ is the Fibonacci or Thue–Morse morphism, we show that the subshift $({\mathcal{S}},T)$ is sofic, that is, the language of ${\mathcal{S}}$ is regular.

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Huy, Phan Trung, e Nguyễn Quý Khang. "Regular omega-languages and finite monoids having infinite products." Journal of Computer Science and Cybernetics 19, n.º 2 (26 de julho de 2012). http://dx.doi.org/10.15625/1813-9663/19/2/1512.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Rabinovich, Alexander, e Doron Tiferet. "Ambiguity Hierarchy of Regular Infinite Tree Languages". Logical Methods in Computer Science Volume 17, Issue 3 (13 de agosto de 2021). http://dx.doi.org/10.46298/lmcs-17(3:18)2021.

Texto completo da fonte

Resumo:

An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if it is k-ambiguous for some $k \in \mathbb{N}$. An automaton is finitely (respectively, countably) ambiguous if for every input it has at most finitely (respectively, countably) many accepting computations. The degree of ambiguity of a regular language is defined in a natural way. A language is k-ambiguous (respectively, boundedly, finitely, countably ambiguous) if it is accepted by a k-ambiguous (respectively, boundedly, finitely, countably ambiguous) automaton. Over finite words every regular language is accepted by a deterministic automaton. Over finite trees every regular language is accepted by an unambiguous automaton. Over $\omega$-words every regular language is accepted by an unambiguous B\"uchi automaton and by a deterministic parity automaton. Over infinite trees Carayol et al. showed that there are ambiguous languages. We show that over infinite trees there is a hierarchy of degrees of ambiguity: For every k > 1 there are k-ambiguous languages that are not k - 1 ambiguous; and there are finitely (respectively countably, uncountably) ambiguous languages that are not boundedly (respectively finitely, countably) ambiguous.

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Klarlund, Nils, Madhavan Mukund e Milind Sohoni. "Determinizing Asynchronous Automata on Infinite Inputs". BRICS Report Series 2, n.º 58 (28 de novembro de 1995). http://dx.doi.org/10.7146/brics.v2i58.19959.

Texto completo da fonte

Resumo:

Asynchronous automata are a natural distributed machine model<br />for recognizing trace languages - languages defined over an alphabet<br />equipped with an independence relation.<br />To handle infinite traces, Gastin and Petit introduced Buchi asynchronous<br />automata, which accept precisely the class of omega-regular trace<br />languages. Like their sequential counterparts, these automata need to<br />be non-deterministic in order to capture all omega-regular languages. Thus<br />complementation of these automata is non-trivial. Complementation<br />is an important operation because it is fundamental for treating the<br />logical connective "not" in decision procedures for monadic second-order<br />logics. Subsequently, Diekert and Muscholl solved the complementation<br />problem by showing that with a Muller acceptance condition, deterministic<br />automata suffice for recognizing omega-regular trace languages.<br />However, a direct determinization procedure, extending the classical<br />subset construction, has proved elusive.<br />In this paper, we present a direct determinization procedure for<br />Buchi asynchronous automata, which generalizes Safra's construction<br />for sequential Buchi automata. As in the sequential case, the blow-up<br />in the state space is essentially that of the underlying subset construction.

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Bartholdi, Laurent, e Marialaura Noce. "Tree languages and branched groups". Mathematische Zeitschrift 303, n.º 4 (20 de março de 2023). http://dx.doi.org/10.1007/s00209-023-03249-y.

Texto completo da fonte

Resumo:

AbstractWe study the portraits of isometries of rooted trees—the labelling of the tree, at each vertex, by the permutation of its descendants—in terms of languages. We characterize regularly branched self-similar groups in terms of $$\omega $$ ω -regular languages. We deduce the algorithmic decidability of some problems, such as the comparison of regularly branched contracting groups, and their orbit structure on the boundary of the rooted tree.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

Livros sobre o assunto "Omega-Regular languages"

1

Greek Exercise Book: The Noun and the Regular Verb In -[Omega. Creative Media Partners, LLC, 2022.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Greek Exercise Book: The Noun and the Regular Verb In -[Omega. Creative Media Partners, LLC, 2018.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Greek Exercise Book: The Noun and the Regular Verb In -[Omega. Creative Media Partners, LLC, 2022.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Kaegi, Adolf, Henri Ternaux-Compans e James Aloysius Kleist. Greek Exercise Book: The Noun and the Regular Verb in -[omega. Franklin Classics Trade Press, 2018.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Kaegi, Adolf, Henri Ternaux-Compans e James Aloysius Kleist. Greek Exercise Book: The Noun and the Regular Verb In -[Omega. Creative Media Partners, LLC, 2018.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Omega-Regular languages"

1

Angluin, Dana, e Dana Fisman. "Learning Regular Omega Languages". In Lecture Notes in Computer Science, 125–39. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11662-4_10.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Edixhoven, Luc, e Sung-Shik Jongmans. "Balanced-By-Construction Regular and $$\omega $$-Regular Languages". In Developments in Language Theory, 130–42. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81508-0_11.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Dimitrova, Rayna, Bernd Finkbeiner e Hazem Torfah. "Approximate Automata for Omega-Regular Languages". In Automated Technology for Verification and Analysis, 334–49. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-31784-3_19.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Chen, Zhe, Yunyun Chen, Robert M. Hierons e Yifan Wu. "Four-Valued Monitorability of $$\omega $$-Regular Languages". In Formal Methods and Software Engineering, 198–214. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63406-3_12.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Orekhovskii, Vladislav, e Victor Selivanov. "Logic vs Topology on Regular $$\omega $$-languages". In Lecture Notes in Computer Science, 141–53. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-36978-0_12.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Skrzypczak, Michał. "Separation for $$\omega \mathrm {B}$$ - and $$\omega \mathrm {S}$$ -regular Languages". In Descriptive Set Theoretic Methods in Automata Theory, 183–203. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-52947-8_11.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Michaud, Thibaud, e Alexandre Duret-Lutz. "Practical Stutter-Invariance Checks for $$\omega $$ -Regular Languages". In Model Checking Software, 84–101. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23404-5_7.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Winkler, Tobias, Christina Gehnen e Joost-Pieter Katoen. "Model Checking Temporal Properties of Recursive Probabilistic Programs". In Lecture Notes in Computer Science, 449–69. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99253-8_23.

Texto completo da fonte

Resumo:

AbstractProbabilistic pushdown automata (pPDA) are a standard operational model for programming languages involving discrete random choices, procedures, and returns. Temporal properties are useful for gaining insight into the chronological order of events during program execution. Existing approaches in the literature have focused mostly on $$\omega $$ ω -regular and LTL properties. In this paper, we study the model checking problem of pPDA against $$\omega $$ ω -visibly pushdown languages that can be described by specification logics such as CaRet and are strictly more expressive than $$\omega $$ ω -regular properties. With these logical formulae, it is possible to specify properties that explicitly take the structured computations arising from procedural programs into account. For example, CaRet is able to match procedure calls with their corresponding future returns, and thus allows to express fundamental program properties like total and partial correctness.

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Löding, Christof, e Anton Pirogov. "Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata". In Lecture Notes in Computer Science, 522–41. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_27.

Texto completo da fonte

Resumo:

AbstractProbabilistic Büchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of languages that goes beyond the regular languages. In this work we extend the known classes of restricted PBA which are still regular, strongly relying on notions concerning ambiguity in classical $$\omega $$ ω -automata. Furthermore, we investigate the expressivity of the not yet considered but natural class of weak PBA, and we also show that the regularity problem for weak PBA is undecidable.

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Li, Yong, Sven Schewe e Qiyi Tang. "A Novel Family of Finite Automata for Recognizing and Learning $$\omega $$-Regular Languages". In Automated Technology for Verification and Analysis, 53–73. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-45329-8_3.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Omega-Regular languages"

1

Chen, Jianhui, e Fei He. "Proving almost-sure termination by omega-regular decomposition". In PLDI '20: 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3385412.3386002.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!