Weighted automata extend classical finite automata by assigning weights, typically drawn from algebraic structures such as semirings, to transitions. This quantitative enhancement enables the analysis ...

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: The equivalence exists between regular grammar and finite automata in accepting languages. Some complicated conversion algorithms have also been in existence. The simplified forms of the ...

The project was proposed in the context of a course on Theory of Computation. The course focuses on the study of formal languages, automata theory, and computability. As part of the course, this ...

Abstract: Defining a membership value (mv) for the strings of a fuzzy grammar/language and the calculation of this mv have been important issues since the inception of fuzzy automata and fuzzy ...

Abstract: Language equations are a powerful tool for compositional synthesis, modeled as the unknown component problem. Given a (sequential) system specification S and a fixed component F, we are ...

ABSTRACT: 1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-way quantum finite state automata (1QFA) and k-letter quantum finite state automata (k-letter ...