Loading...

On the gap between separating words and separating their reversals

Ebrahimnejad, F ; Sharif University of Technology | 2017

323 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.tcs.2017.11.012
  3. Publisher: Elsevier B.V , 2017
  4. Abstract:
  5. A deterministic finite automaton (DFA) separates two strings w and x if it accepts w and rejects x. The minimum number of states required for a DFA to separate w and x is denoted by sep(w,x). The present paper shows that the difference |sep(w,x)-sep(wR,xR)| is unbounded for a binary alphabet; here wR stands for the mirror image of w. This solves an open problem stated in Demaine et al. (2011) © 2017 Elsevier B.V
  6. Keywords:
  7. Finite automata ; Words separation ; Binary alphabets ; Deterministic finite automata ; Mirror images ; Number of state ; Separation
  8. Source: Theoretical Computer Science ; 2017 ; 03043975 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S0304397517308423