Group Separation Strikes Back

Place, Thomas; Zeitoun, Marc

doi:10.1109/lics56636.2023.10175683

Search citation statements

Order By: Relevance

Paper Sections

Select...

Other1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, the decidability of GR-separation is equivalent to a difficult algebraic question, which remained open for several years before it was solved by Ash [5]. Recent automata-based proofs that separation is decidable for MOD, AMT and GR are available in [28].…”

Section: E F I N I T I O N 2 mentioning

confidence: 99%

All about unambiguous polynomial closure

Place,

Zeitoun

2024

TheoretiCS

View full text Add to dashboard Cite

We study a standard operator on classes of languages: unambiguous polynomial closure. We prove that for every class C of regular languages satisfying mild properties, the membership problem for its unambiguous polynomial closure UPol(C) reduces to the same problem for C. We also show that unambiguous polynomial closure coincides with alternating left and right deterministic closure. Moreover, we prove that if additionally C is finite, the separation and covering problems are decidable for UPol(C). Finally, we present an overview of the generic logical characterizations of the classes built using unambiguous polynomial closure.

show abstract

Section: E F I N I T I O N 2 mentioning

confidence: 99%