Inverse star, borders, and palstars

DOI10.1016/j.ipl.2011.01.018zbMath1260.68212arXiv1008.2440OpenAlexW2171449397MaRDI QIDQ1944913

Narad Rampersad, Wang, Ming-wei, Jeffrey O. Shallit

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.2440

zbMATH Keywords

shufflecontext-free languageregular languageformal languageKleene starpalstarprime palstar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Factorization in Formal Languages ⋮ Automatic Theorem-Proving in Combinatorics on Words ⋮ Counting the palstars ⋮ Borders, palindrome prefixes, and square prefixes ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS ⋮ Unique decipherability in formal languages

Cites Work

• Unnamed Item
• Results and trends in theoretical computer science, Colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994. Proceedings
• Closures in Formal Languages and Kuratowski’s Theorem
• Enumeration of bordered words, le langage de la vache-qui-rit
• Endliche 0-1-Folgen mit gleichen Teilblöcken.
• Fast Pattern Matching in Strings
• A note on bifix-free sequences (Corresp.)
• Roots of Star Events
• A helpful result for proving inherent ambiguity

This page was built for publication: Inverse star, borders, and palstars