query: Automata - proving the reverse operation through induction N elements
positive_passages.docid: 21254
positive_passages.text: Formal language: Proving the reverse operation on a word through induction
negative_passages.docid: 111349
negative_passages.text: Finite automaton that recognizes the empty language $\emptyset$
negative_passages.docid: 46698
negative_passages.text: Showing a set is closed under inverses
negative_passages.docid: 100256
negative_passages.text: Proof by induction on a rooted tree with even number of vertices
negative_passages.docid: 42105
negative_passages.text: Fibonacci proof by induction
negative_passages.docid: 115435
negative_passages.text: Induction: prove using congruences
negative_passages.docid: 58481
negative_passages.text: Exclusion Inclusion Principle Induction Proof
negative_passages.docid: 61602
negative_passages.text: Binary strings (words) proof
negative_passages.docid: 34723
negative_passages.text: Proof of a limit for a recursively-defined sequence
negative_passages.docid: 107281
negative_passages.text: Proof of Existence of Algebraic Closure: Too simple to be true?
negative_passages.docid: 91896
negative_passages.text: Induction (Geometric sequence)
negative_passages.docid: 46430
negative_passages.text: A simple decision problem whose decidability is not known
negative_passages.docid: 19326
negative_passages.text: What makes induction a valid proof technique?
negative_passages.docid: 106183
negative_passages.text: Proof by Induction: Alternating Sum of Fibonacci Numbers
negative_passages.docid: 140682
negative_passages.text: Proving a property of a Logic Formal Language
negative_passages.docid: 92359
negative_passages.text: Big-O Notation Proof
negative_passages.docid: 76029
negative_passages.text: Induction proof: n lines in a plane