A web-based project that converts regular expressions into Deterministic Finite Automata (DFA), Context-Free Grammars (CFG), and Pushdown Automata (PDA) ...

Abstract: Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, term-rewriting, symbolic computation and non-procedural ...

This repository contains two projects from the Theory of Machines and Languages course, implementing fundamental concepts in formal language theory and automata. Objective: Design and implement a ...

Abstract: This paper is about conformance testing of non deterministic timed pushdown automata with inputs and outputs (TPAIO), that specify both stack and clock constraints. It proposes a novel ...

Fuzzy automata extend traditional automata theory by incorporating the principles of fuzzy logic to address uncertainty in computational processes. Unlike classical automata, where transitions are ...