Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Namespaces | Functions | Variables
AutomataConcatenation.h File Reference
#include <automaton/FSM/NFA.h>
#include <automaton/FSM/DFA.h>
#include <label/InitialStateLabel.h>
Include dependency graph for AutomataConcatenation.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  automaton::transform::AutomataConcatenation
 

Namespaces

namespace  automaton
 
namespace  automaton::transform
 

Functions

automaton::NFA< typename AutomatonType::SymbolType, ext::pair< typename AutomatonType::StateType, unsigned > > automaton::transform::res ({ first.getInitialState(), FIRST })
 
 automaton::transform::for (const auto &q :first.getStates()) res.addState(
 
 automaton::transform::for (const auto &q :second.getStates()) res.addState( { t.second, SECOND } )
 
res automaton::transform::addInputSymbols (first.getInputAlphabet())
 
res automaton::transform::addInputSymbols (second.getInputAlphabet())
 
 automaton::transform::for (const auto &t :first.getTransitions())
 
 automaton::transform::for (const auto &t :second.getTransitions()) res.addTransition(
 
 automaton::transform::if (first.getFinalStates().contains(first.getInitialState()))
 

Variables

t first automaton::transform::second
 
return automaton::transform::res