Can a regular expression be defined using recursion?
Sunday, 07 April 2024
by Cyrille Romeo Kouadio
In the realm of regular expressions, it is indeed possible to define them using recursion. Regular expressions are a fundamental concept in computer science and are widely used for pattern matching and text processing tasks. They are a concise and powerful way to describe sets of strings based on specific patterns. Regular expressions can be
- Published in Cybersecurity, EITC/IS/CCTF Computational Complexity Theory Fundamentals, Regular Languages, Regular Expressions
Tagged under:
Computer Science, Cybersecurity, Pattern Matching, Python, Recursion, Regular Expressions
How can the recursion theorem be used to create a program that accesses and executes its own code?
Thursday, 03 August 2023
by EITCA Academy
The recursion theorem is a fundamental concept in computer science that allows for the creation of programs capable of accessing and executing their own code. This concept is particularly relevant in the field of cybersecurity as it provides insights into the theoretical foundations of computational complexity and the potential vulnerabilities that can arise from self-referential
- Published in Cybersecurity, EITC/IS/CCTF Computational Complexity Theory Fundamentals, Recursion, Program that prints itself, Examination review
Tagged under:
Computational Complexity, Computer Science, Cybersecurity, Program Execution, Recursion