Article

Separating Regular Languages with Two Quantifiers Alternations

Author:

Thomas PlaceAuthors Info & Claims

LICS '15: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Pages 202 - 213

https://doi.org/10.1109/LICS.2015.28

Published: 06 July 2015 Publication History

Get Access

References

[1]

J. Almeida and O. Klíma. New decidable upper bound of the 2nd level in the Straubing-Thérien concatenation hierarchy of star-free languages. Disc. Math. & Theo. Comp. Sci., 2010.

Google Scholar

[2]

M. Arfi. Polynomial operations on rational languages. In STACS'87, 1987.

Digital Library

Google Scholar

[3]

J. Brzozowski and R. Knast. The dot-depth hierarchy of star-free languages is infinite. J. Comp. Syst. Sci., 1978.

Google Scholar

[4]

M. Bojanczyk. Factorization forests. In DLT'09, 2009.

Digital Library

Google Scholar

[5]

W. Czerwinski, W. Martens, and T. Masopust. Efficient separability of regular languages by subsequences and suffixes. In ICALP'13, 2013.

Digital Library

Google Scholar

[6]

V. Diekert and P. Gastin. First-order definable languages. In Logic and Automata: History and Perspectives, volume 2. Amsterdam Univ. Press, 2008.

Google Scholar

[7]

C. Glaser and H. Schmitz. Languages of dot-depth 3/2. In (STACS'00), 2000.

Digital Library

Google Scholar

[8]

R. Knast. A semigroup characterization of dot-depth one languages. RAIRO, 1983.

Crossref

Google Scholar

[9]

M. Kufleitner. The height of factorization forests. In MFCS'08, 2008.

Digital Library

Google Scholar

[10]

R. McNaughton and S. Papert. Counter-Free Automata. 1971.

Google Scholar

[11]

J.E. Pin. Bridges for concatenation hierarchies. In ICALP'98, 1998.

Digital Library

Google Scholar

[12]

J.E. Pin. Theme and variations on the concatenation product. In CAI'11, 2011.

Digital Library

Google Scholar

[13]

T. Place, L. Rooijen, and M. Zeitoun. Separating regular languages by piecewise testable and unambiguous languages. In MFCS'13, 2013.

Crossref

Google Scholar

[14]

J.E. Pin and P. Weil. Polynomial closure and unambiguous product. Theory Comp. Syst., 1997.

Crossref

Google Scholar

[15]

T. Place and M. Zeitoun. Going higher in the first-order quantifier alternation hierarchy on words. In ICALP'14, 2014.

Crossref

Google Scholar

[16]

T. Place and M. Zeitoun. Separating regular languages with first-order logic. In CSL-LICS'14, 2014.

Digital Library

Google Scholar

[17]

T. Place and M. Zeitoun. Separation and the successor relation. In STACS'15, 2015.

Google Scholar

[18]

M.P. Schützenberger. On finite monoids having only trivial subgroups. Information and Control, 1965.

Crossref

Google Scholar

[19]

I. Simon. Piecewise testable events. In 2nd GI Conference on Automata Theory and Formal Languages, 1975.

Digital Library

Google Scholar

[20]

I. Simon. Factorization forests of finite height. TCS, 1990.

Digital Library

Google Scholar

[21]

W. Thomas. Classifying regular events in symbolic logic. J. Comp. Syst. Sci., 1982.

Google Scholar

Cited By

View all

Jung JWolter FGorla D(2021)Living without beth and craigProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470585(1-14)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470585
Czerwiński WZetzsche GHermanns HZhang LKobayashi NMiller D(2020)An Approach to Regular Separability in Vector Addition SystemsProceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3373718.3394776(341-354)Online publication date: 8-Jul-2020
https://dl.acm.org/doi/10.1145/3373718.3394776
Place TZeitoun MBouyer P(2019)Separation and covering for group based concatenation hierarchiesProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3470152.3470153(1-13)Online publication date: 24-Jun-2019
https://dl.acm.org/doi/10.5555/3470152.3470153
Show More Cited By

Separating Regular Languages with Two Quantifiers Alternations
1. Software and its engineering
  1. Software notations and tools
2. Theory of computation

Recommendations

Unambiguity in timed regular languages: automata and logics
FORMATS'10: Proceedings of the 8th international conference on Formal modeling and analysis of timed systems

Unambiguous languages (UL), originally defined by Schutzenberger using unambiguous polynomials, are a robust subclass of regular languages. They have many diverse characterizations: they are recognized by partially-ordered two-way deterministic automata ...
Restarting Transducers, Regular Languages, and Rational Relations

A (nonforgetting) restarting transducer is a (nonforgetting) restarting automaton that is equipped with an output function. Accordingly, restarting transducers compute binary relations, and deterministic restarting transducers compute functions. Here we ...
Non-regular Maximal Prefix-Free Subsets of Regular Languages
DLT 2016: Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840

We investigate non-regular maximal prefix-free subsets MPFS of regular languages. We give a method to decide whether or not a regular language has any non-regular MPFS.

Next, we prove that if a regular language has any non-regular MPFS, then it also has ...

Comments

Information & Contributors

Information

Published In

LICS '15: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

July 2015

776 pages

ISBN:9781479988754

In-Cooperation

EACSL: European Association for Computer Science Logic

Publisher

IEEE Computer Society

United States

Publication History

Published: 06 July 2015

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 215 of 622 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
37
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jung JWolter FGorla D(2021)Living without beth and craigProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470585(1-14)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470585
Czerwiński WZetzsche GHermanns HZhang LKobayashi NMiller D(2020)An Approach to Regular Separability in Vector Addition SystemsProceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3373718.3394776(341-354)Online publication date: 8-Jul-2020
https://dl.acm.org/doi/10.1145/3373718.3394776
Place TZeitoun MBouyer P(2019)Separation and covering for group based concatenation hierarchiesProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3470152.3470153(1-13)Online publication date: 24-Jun-2019
https://dl.acm.org/doi/10.5555/3470152.3470153
Place TZeitoun M(2019)Adding SuccessorACM Transactions on Computational Logic10.1145/335633921:2(1-45)Online publication date: 17-Nov-2019
https://dl.acm.org/doi/10.1145/3356339
Place TZeitoun M(2019)Going Higher in First-Order Quantifier Alternation Hierarchies on WordsJournal of the ACM10.1145/330399166:2(1-65)Online publication date: 13-Mar-2019
https://dl.acm.org/doi/10.1145/3303991
Place TZeitoun M(2019)Generic Results for Concatenation HierarchiesTheory of Computing Systems10.1007/s00224-018-9867-063:4(849-901)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s00224-018-9867-0
Place TZeitoun MAceto LIngólfsdóttir A(2017)Separation for dot-depth twoProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330005(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330005
Place TZeitoun M(2015)The tale of the quantifier alternation hierarchy of first-order logic over wordsACM SIGLOG News10.1145/2815493.28154952:3(4-17)Online publication date: 17-Aug-2015
https://dl.acm.org/doi/10.1145/2815493.2815495

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Unambiguity in timed regular languages: automata and logics

Restarting Transducers, Regular Languages, and Rational Relations

Non-regular Maximal Prefix-Free Subsets of Regular Languages

Comments

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

References

Cited By

Recommendations

Unambiguity in timed regular languages: automata and logics

Restarting Transducers, Regular Languages, and Rational Relations

Non-regular Maximal Prefix-Free Subsets of Regular Languages

Comments

Information

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations