Regular expressions and finite automata are fundamental concepts in computer science that are intimately linked to the tasks of pattern matching and string processing. Regular expressions are a robust ...

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

Abstract: A Regular Expression, often abbreviated as Regex, are a sequence of characters that define a search pattern. An Non-deterministic Finite Automata (NFA) is a computational machine which can ...

ABSTRACT: In this paper, we use some programing tools and algorithms for solving system of word equation for regular languages. There are many possibilities for presentation of regular languages such ...

ABSTRACT: The paper continues the research on algorithms for generating nondeterministic finite automata possessing the following property (the so-called walibad property): among their covering ...