It's true, not false. You refer to a misleading overloading of the term when referring to the stack machines needed to realize 'regular expressions with backre

It's true, not false. You refer to a misleading overloading of the term when referring to the stack machines needed to realize 'regular expressions with backreference memories', which expands the language class to which they correspond. Citation : https://www.amazon.com/Introduction-Automata-Languages-Computation-Addison-Wesley/dp/020102988X https://www.amazon.com/Introduction-Automata-Languages-Compu...