Results 51 to 60 of about 4,638,570 (374)
Most Complex Non-Returning Regular Languages [PDF]
, 2017 A regular language $L$ is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state.
B Krawetz +11 more
core +3 more sources
Nondeterministic State Complexity for Suffix-Free Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We investigate the nondeterministic state complexity of basic operations for suffix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal ...
Yo-Sub Han, Kai Salomaa
doaj +1 more source
Extensions of ω-Regular Languages [PDF]
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020 We consider extensions of monadic second-order logic over ω-words, which are obtained by adding one language that is not ω-regular. We show that if the added language L has a neutral letter, then the resulting logic is necessarily undecidable. A corollary is that the ω-regular languages are the only decidable Boolean-closed full trio over ω-words.
Bojańczyk, Mikołaj +3 more
openaire +3 more sources
Most Complex Regular Right-Ideal Languages [PDF]
, 2013 A right ideal is a language L over an alphabet A that satisfies L = LA*. We show that there exists a stream (sequence) (R_n : n \ge 3) of regular right ideal languages, where R_n has n left quotients and is most complex under the following measures of ...
J. Bell +9 more
core +3 more sources
On the Boundary of Regular Languages
Theoretical Computer Science, 2013 We prove that the tight bound on the state complexity of the boundary of regular languages, defined as bd ( L ) = L * ? ( L ? ) * , is 3 / 8 ? 4 n + 2 n - 2 - 2 ? 3 n - 2 - n + 2 . Our witness languages are described over a five-letter alphabet. Next, we show that this bound cannot be met by any quaternary language if n ? 5 .
Galina Jirásková, Jozef Jirásek
openaire +3 more sources
On Notions of Regularity for Data Languages [PDF]
Theoretical Computer Science, 2007 AbstractWith motivation from considerations in XML database theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position, a symbol and a data value from an infinite domain. Previous work has shown that it is difficult to come up with an expressive yet decidable automaton model for
Thomas Schwentick, Henrik Björklund
openaire +2 more sources
A survey on difference hierarchies of regular languages [PDF]
Logical Methods in Computer Science, 2018 Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of regular languages.
Olivier Carton +2 more
doaj +1 more source
Logic Meets Algebra: the Case of Regular Languages [PDF]
Logical Methods in Computer Science, 2007 The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e.
Pascal Tesson, Denis Therien
doaj +1 more source
Efficient and Generalized Decentralized Monitoring of Regular Languages [PDF]
Formal Techniques for (Networked and) Distributed Systems, 2014 This paper proposes an efficient and generalized decentralized monitoring algorithm allowing to detect satisfaction or violation of any regular specification by local monitors alone in a system without central observation point.
Ylìès Falcone +2 more
openalex +2 more sources
Varieties of Cost Functions. [PDF]
, 2016 Regular cost functions were introduced as a quantitative generalisation of regular languages, retaining many of their equivalent characterisations and decidability properties.
Daviaud, L., Kuperberg, D., Pin, J-E.
core +4 more sources