theorem
Theorem 2.3
Loff–Moreira–Reis [12, Theorem 16, p. 21]
Theorem 2.3 (Loff–Moreira–Reis [12, Theorem 16, p. 21]). A language is in if and only if is decided by some scaffolding automaton.
theorem
Loff–Moreira–Reis [12, Theorem 16, p. 21]
Theorem 2.3 (Loff–Moreira–Reis [12, Theorem 16, p. 21]). A language is in if and only if is decided by some scaffolding automaton.