New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages

Almeida, Jorge; Klíma, Ondřej

doi:10.46298/dmtcs.490

Cited by 5 publications

(18 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Intuitively, we want to find an idempotent in the sequence R 1 • • • R kn+1 in order to apply Operation (2). Observe that since the R j are elements of the monoid 2 M n and k n = 2 |M| n , the sequence R 1 • • • R kn+1 must contain a "loop."…”

Section: Fact 24mentioning

confidence: 99%

“…Intuitively, each type of node corresponds to a part of the algorithm that computes Σ 2 -chains. Initial leaves correspond to the initial trivial compatible sets from which the algorithm starts, product nodes correspond to the product (1), finally operation nodes and leaves can only be used together and correspond to the application of (2). We now give a precise definition of each type of node.…”

Section: D1 Definitionmentioning

confidence: 99%

“…In particular, the case of BΣ 2 has a very rich history and a series of combinatorial, logical, and algebraic conjectures have been proposed over the years. We refer to [12,2,11,13] for an exhaustive bibliography. So far, the only known effective result was partial, working only when the alphabet is of size 2 [25].…”

mentioning

confidence: 99%

“…2 [α] by assumption, there exist w 1 , w 2 , w 3 such that w and α(w 1 ) = s 1 , α(w 2 ) = s 2 , α(w 3 ) = s 3 . Set u, v ∈ A * .…”

mentioning

confidence: 99%

“…2 [α] which contradicts that C 2 [α] has unbounded alternation (recall that s = s ′ ). By definition for all k ∈ N there exists ℓ k such that α(w ℓ ) = s and α(w ′ ℓ ) = s ′ , since ℓ k and by definition of ∼ = k 2 this means that : Hence for all k, j, (s, s ′ ) j ∈ C k 2 [α] and therefore, for all j (s, s ′ ) j ∈ C 2 [α] which terminates the proof.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words

Place

Zeitoun

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We investigate the quantifier alternation hierarchy in firstorder logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a regular language to the levels BΣ2 (boolean combination of formulas having only 1 alternation) and Σ3 (formulas having only 2 alternations beginning with an existential block). Our proof works by considering a deeper problem, called separation, which, once solved for lower levels, allows us to solve membership for higher levels.The connection between logic and automata theory is well known and has a fruitful history in computer science. It was first observed when Büchi, Elgot and Trakhtenbrot proved independently that the regular languages are exactly those that can be defined using a monadic second-order logic (MSO) formula. Since then, many efforts have been made to investigate and understand the expressive power of relevant fragments of MSO. In this field, the yardstick result is often to prove decidable characterizations, i.e., to design an algorithm which, given as input a regular language, decides whether it can be defined in the fragment under investigation. More than the algorithm itself, the main motivation is the insight given by its proof. Indeed, in order to prove a decidable characterization, one has to consider and understand all properties that can be expressed in the fragment.The most prominent fragment of MSO is first-order logic (FO) equipped with a predicate "<" for the linear-order. The expressive power of FO is now well-understood over words and a decidable characterization has been obtained. The result, Schützenberger's Theorem [20,10], states that a regular language is definable in FO if and only if its syntactic monoid is aperiodic. The syntactic monoid is a finite algebraic structure that can effectively be computed from any representation of the language. Moreover, aperiodicity can be rephrased as an equation that needs to be satisfied by all elements of the monoid. Therefore, Schützenberger's Theorem can indeed be used to decide definability in FO.In this paper, we investigate an important hierarchy inside FO, obtained by classifying formulas according to the number of quantifier alternations in their prenex normal form. More precisely, an FO formula is Σ i if its prenex normal form has at most (i − 1) quantifier alternations and starts with a block of existential quantifiers. The hierarchy also involves the classes BΣ i of boolean combinations of Σ i formulas, and the classes ∆ i of languages that can be defined ⋆ Supported by ANR 2010 BLAN 0202 01 FREC Our solution works as follows: given two regular languages, one can easily construct a monoid morphism α : A * → M that recognizes both of them. We then design an algorithm that computes, inside the monoid M , enough Σ 2 -related information to answer the Σ 2 -separation question for any pair of languages that are recognized by α. It turns out that it is also possible (though much more difficult) to use thi...

show abstract

Section: Fact 24mentioning

confidence: 99%

Section: D1 Definitionmentioning

confidence: 99%

mentioning

confidence: 99%

“…2 [α] by assumption, there exist w 1 , w 2 , w 3 such that w and α(w 1 ) = s 1 , α(w 2 ) = s 2 , α(w 3 ) = s 3 . Set u, v ∈ A * .…”

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words

Place

Zeitoun

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Going Higher in First-Order Quantifier Alternation Hierarchies on Words

Place

Zeitoun

2019

J. ACM

View full text Add to dashboard Cite

We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a regular language in the levels BΣ 2 (finite boolean combinations of formulas having only one alternation) and Σ 3 (formulas having only two alternations and beginning with an existential block). Our proofs work by considering a deeper problem, called separation, which, once solved for lower levels, allows us to solve membership for higher levels.A:3 to be decidable. The class BΣ 1 (<) consists exactly of all piecewise testable languages, i.e., such that membership of a word only depends on its scattered subwords up to a fixed size. These languages were characterized by Simon [1975] as those whose syntactic monoid is J-trivial. A decidable characterization of Σ 2 (<)-hence of ∆ 2 (<) as well-was obtained by Arfi [1987;, a problem revisited and clarified by Pin and Weil [1995;, who also set up a generic algebraic framework to work with. For ∆ 2 (<), the literature is very rich, see the survey by Tesson and Thérien [2002]. For example, the ∆ 2 (<) definable languages are exactly the ones definable in the two-variable restriction of FO(<) [Thérien and Wilke 1998]. These are also the languages whose syntactic monoid belongs to the class DA, as shown again by Pin and Weil [1995; (see also [Schützenberger 1976]). For higher levels in the hierarchy, getting decidable characterizations remained a major open problem. In particular, the case of BΣ 2 (<) has a very abundant history and a series of combinatorial, logical, and algebraic conjectures have been proposed over the years. We refer to Section 3 and to several surveys cited in this section for a bibliography. So far, the only known effective result was partial, working only when the alphabet is of size 2 [Straubing 1988].Contributions.. In this paper, we establish decidable characterizations for the fragments BΣ 2 (<), ∆ 3 (<) and Σ 3 (<) of first-order logic. These new results are based on a deeper decision problem than membership: the separation problem. Fix a class C of languages. The C-separation problem amounts to deciding whether, given two input regular languages, there exists a third language in C containing the first language while being disjoint from the second one. Solving the C-separation problem is more general than obtaining a decidable characterization for the class C. Indeed, since regular languages are effectively closed under complement, testing membership in C can be achieved by testing whether the input is C-separable from its complement. While this reduction immediately transfers decision procedures for one problem to the other, this is not our primary motivation for looking at separation. Although intrinsically more challenging, a solution to the separation problem requires more understanding than just getting a decidable characterization. This understanding for a given fragment can then be exploited in order to ob...

show abstract

First-order fragments with successor over infinite words

Kallas¹,

Kufleitner

Lauser

2010

View full text Add to dashboard Cite

New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages

Cited by 5 publications

References 11 publications

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words

Going Higher in First-Order Quantifier Alternation Hierarchies on Words

First-order fragments with successor over infinite words

Contact Info

Product

Resources

About