This repository provides tools to construct finite automata and context-free grammars in Python and test them against a given rule for correctness. This testing is done using Hypothesis, a python ...

This paper proposes a new computational model, Rough Pushdown Automata (R-PDA), which extends the capabilities of traditional Pushdown Automata by incorporating Rough Set Theory. The proposed R-PDA is ...

Project for Formal Languages and Automata Theory (IF2124) course from School of Electrical Engineering and Informatics, Bandung Institute of Technology. A Parser for Javascript (node.js) made in ...

Abstract: The purpose of this paper is to generalize the methods of automata theory to accommodate infinite input alphabets and to propose a method of describing computer languages such as ALGOL-60 ...

A formal-linguistic approach for solving an entertaining task is offered in this paper. The well-known task of the Hanoi towers is discussed in relation to some concepts of formal languages and ...

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 ...

Automata theory and temporal logic are essential areas of computer science that deal with the formalization of computation and the reasoning about time-dependent behaviors in systems. These fields ...