On the gap between separating words and separating their reversals

DOI10.1016/j.tcs.2017.11.012zbMath1390.68390arXiv1605.04835OpenAlexW2528363664MaRDI QIDQ1698731

Farzam Ebrahimnejad

Publication date: 16 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

finite automatawords separation

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• State complexity of union and intersection of square and reversal on \(k\) regular languages
• Separating strings with small automata
• The state complexities of some basic operations on regular languages
• On the State Complexity of Complements, Stars, and Reversals of Regular Languages
• Separating words with machines and groups
• Remarks on Separating Words

This page was built for publication: On the gap between separating words and separating their reversals