This repository contains a Python implementation of a Deterministic Pushdown Automaton (DPDA). A DPDA is a type of automaton used in formal language theory, capable of recognizing context-free ...

When it comes to the input and output format of the simulation of the machine, " ̃ " is used to represent lambda/epsilon λ . As for the inputted fields and format for the machine definition file, the ...

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

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

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