Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 100 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 33 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 200 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

On the piecewise complexity of words and periodic words (2311.15431v1)

Published 26 Nov 2023 in cs.FL

Abstract: The piecewise complexity $h(u)$ of a word is the minimal length of subwords needed to exactly characterise $u$. Its piecewise minimality index $\rho(u)$ is the smallest length $k$ such that $u$ is minimal among its order-$k$ class $[u]_k$ in Simon's congruence. We study these two measures and provide efficient algorithms for computing $h(u)$ and $\rho(u)$. We also provide efficient algorithms for the case where $u$ is a periodic word, of the form $u=vn$

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. Scattered factor-universality of words. In Proc. DLT 2020, volume 12086 of Lecture Notes in Computer Science, pages 14–28. Springer, 2020.
  2. Piecewise testable tree languages. Logical Methods in Comp. Science, 8(3), 2012.
  3. O. Carton and M. Pouzet. Simon’s theorem for scattered words. In Proc. DLT 2018, volume 11088 of Lecture Notes in Computer Science, pages 182–193. Springer, 2018.
  4. A survey on small fragments of first-order logic over finite words. Int. J. Foundations of Computer Science, 19(3):513–548, 2008.
  5. L. Fleischer and M. Kufleitner. Testing Simon’s congruence. In Proc. MFCS 2018, volume 117 of Leibniz International Proceedings in Informatics, pages 62:1–62:13. Leibniz-Zentrum für Informatik, 2018.
  6. Efficiently testing Simon’s congruence. In Proc. STACS 2021, volume 187 of Leibniz International Proceedings in Informatics, pages 34:1–34:18. Leibniz-Zentrum für Informatik, 2021.
  7. J. Goubault-Larrecq and S. Schmitz. Deciding piecewise testable separability for regular tree languages. In Proc. ICALP 2016, volume 55 of Leibniz International Proceedings in Informatics, pages 97:1–97:15. Leibniz-Zentrum für Informatik, 2016.
  8. J.-J. Hébrard. An algorithm for distinguishing efficiently bit-strings by their subsequences. Theoretical Computer Science, 82(1):35–49, 1991.
  9. S. Halfon and Ph. Schnoebelen. On shuffle products, acyclic automata and piecewise-testable languages. Information Processing Letters, 145:68–73, 2019.
  10. Kernel methods for learning languages. Theoretical Computer Science, 405(3):223–236, 2008.
  11. On the index of Simon’s congruence for piecewise testability. Information Processing Letters, 115(4):515–519, 2015.
  12. O. Klíma. Piecewise testable languages via combinatorics on words. Discrete Mathematics, 311(20):2124–2127, 2011.
  13. P. Karandikar and Ph. Schnoebelen. The height of piecewise-testable languages with applications in logical complexity. In Proc. CSL 2016, volume 62 of Leibniz International Proceedings in Informatics, pages 37:1–37:22. Leibniz-Zentrum für Informatik, 2016.
  14. P. Karandikar and Ph. Schnoebelen. The height of piecewise-testable languages and the complexity of the logic of subwords. Logical Methods in Comp. Science, 15(2), 2019.
  15. O. Matz. On piecewise testable, starfree, and recognizable picture languages. In Proc. FOSSACS ’98, volume 1378 of Lecture Notes in Computer Science, pages 203–210. Springer, 1998.
  16. T. Masopust and M. Thomazo. On the complexity of k𝑘kitalic_k-piecewise testability and the depth of automata. In Proc. DLT 2015, volume 9168 of Lecture Notes in Computer Science, pages 364–376. Springer, 2015.
  17. J.-É. Pin. Varieties of Formal Languages. Plenum, New-York, 1986.
  18. D. Perrin and J.-É. Pin. Infinite words: Automata, Semigroups, Logic and Games, volume 141 of Pure and Applied Mathematics Series. Elsevier Science, 2004.
  19. Cognitive and sub-regular complexity. In Proc. FG 2012 & 2013, volume 8036 of Lecture Notes in Computer Science, pages 90–108. Springer, 2013.
  20. I. Simon. Hierarchies of Event with Dot-Depth One. PhD thesis, University of Waterloo, Waterloo, ON, Canada, 1972.
  21. I. Simon. Piecewise testable events. In Proc. 2nd GI Conf. on Automata Theory and Formal Languages, volume 33 of Lecture Notes in Computer Science, pages 214–222. Springer, 1975.
  22. I. Simon. Words distinguished by their subwords. In Proc. WORDS 2003, 2003.
  23. J. Sakarovitch and I. Simon. Subwords. In M. Lothaire, editor, Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and Its Applications, chapter 6, pages 105–142. Cambridge Univ. Press, 1983.
  24. Ph. Schnoebelen and J. Veron. On arch factorization and subword universality for words and compressed words. In Proc. WORDS 20123, volume 13899 of Lecture Notes in Computer Science, pages 274–287. Springer, 2023.
  25. G. Zetzsche. Separability by piecewise testable languages and downward closures beyond subwords. In Proc. LICS 2018, pages 929–938. ACM Press, 2018.
Citations (2)
View on Semantic Scholar
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now