Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Static Public Member Functions
automaton::simplify::SingleInitialState Class Reference

#include <SingleInitialState.h>

Static Public Member Functions

template<class T >
requires isMultiInitialStateNFA < T > || isMultiInitialStateEpsilonNFA < T >
static SingleInitialState::ConvertedAutomaton< T > convert (const T &fsm)
 
template<class T >
requires isDFA < T > || isNFA < T > || isEpsilonNFA < T > || isExtendedNFA < T > || isCompactNFA < T >
static T convert (const T &fsm)
 

Detailed Description

Algorithm for the conversion of multi-initial state finite automata to single-initial state finite automata. This algorithm is an implementation of Melichar: Jazyky a překlady 2.46.

See also
automaton::simplify::SingleInitialStateEpsilonTransition

Member Function Documentation

◆ convert() [1/2]

template<class T >
requires isMultiInitialStateNFA < T > || isMultiInitialStateEpsilonNFA < T >
static SingleInitialState::ConvertedAutomaton< T > automaton::simplify::SingleInitialState::convert ( const T &  fsm)
static

Converts multi-initial state automaton to a single-initial state automaton.

Template Parameters
Ttype of the converted automaton.
Parameters
automatonautomaton to convert
Returns
an automaton equivalent to with only one initial state

◆ convert() [2/2]

template<class T >
requires isDFA < T > || isNFA < T > || isEpsilonNFA < T > || isExtendedNFA < T > || isCompactNFA < T >
T automaton::simplify::SingleInitialState::convert ( const T &  fsm)
static

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.


The documentation for this class was generated from the following file: