This report contains the detailed description of our program. The program talks about how Context free languages can be implemented through a programming language, in this case; JavaScript. In order ...

This project serves as the final exam submission for the Automata Theory and Formal Languages course. This application is designed to provide a comprehensive solution for converting regular ...

Abstract: Black-box context-free grammar inference is a hard problem as in many practical settings it only has access to a limited number of example programs. The state-of-the-art approach Arvada ...

Abstract: Recently, we introduced and investigated a colored variant of finite automata, so-called "colored finite automata." Its accepting states are able to be differently colored each and therefore ...