Deterministic automata for extended regular expressions
| Autor: | Mirzakhmet Syzdykov |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES General Computer Science Powerset construction Computer science overriding QA75.5-76.95 Automaton TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES automaton extended operators Electronic computers. Computer science intelligent complexity subset construction Regular expression Computer Science::Formal Languages and Automata Theory |
| Zdroj: | Open Computer Science, Vol 7, Iss 1, Pp 24-28 (2017) |
| ISSN: | 2299-1093 |
| DOI: | 10.1515/comp-2017-0004 |
| Popis: | In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement. The method like “overriding” of the source NFA(NFA not defined) with subset construction rules is used. The past work described only the algorithm for AND-operator (or intersection of regular languages); in this paper the construction for the MINUS-operator (and complement) is shown. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|