Language

Prototype

template <class DFA, class OutputIterator> 
void language(const DFA &A, OutputIterator out, const typename DFA::Alphabet &separator ='\n');

Description

Conputes the reconized language of A, and writes it through out with separator between words .

Definition

Defined in langage.h.

Requirements on types

DFA is a model of DFA .
OutputIterator is a model of OutputIterator.

Preconditions

OutputIterator::value_type == DFA::Alphabet.
separator type == DFA::Alphabet.

Example

CODE

OUTPUT

#include <tag.h>
#include <dfa_matrix.h>
#include <alphabet.h>
#include <language.h>
#include <iterator>
#include <iostream.h>

//code corresponding to the DFA example, without
//the 10 to 8 transition, in order to avoid cyclicity

main()
{
//spécifie the type of the DFA
typedef DFA_matrix<Range_alphabet<char,'a','g'>,default_tag> DFA_type;

//initialising the DFA, empty
DFA_type dfa;

//creating and adding the states
DFA_type::State s[11];
for(int i=1;i<=10;i++)
s[i]=dfa.new_state();

//setting the transitions
dfa.set_trans(s[1],'a',s[2]);
dfa.set_trans(s[1],'b',s[3]);
dfa.set_trans(s[2],'f',s[4]);
dfa.set_trans(s[2],'b',s[5]);
dfa.set_trans(s[3],'c',s[6]);
dfa.set_trans(s[4],'g',s[7]);
dfa.set_trans(s[4],'e',s[9]);
dfa.set_trans(s[5],'g',s[8]);
dfa.set_trans(s[6],'b',s[5]);
dfa.set_trans(s[6],'d',s[8]);
dfa.set_trans(s[6],'e',s[10]);
dfa.set_trans(s[8],'d',s[10]);

//declaring initial and finals states...VERY IMPORTANT...
dfa.initial(s[1]);
dfa.final(s[5])=true;
dfa.final(s[9])=true;
dfa.final(s[10])=true;

//writing the language on the standart output
language(dfa,ostream_iterator<DFA_type::alphabet>(cout));
}

# ./language
ab
abgd
afe
bcb
bcbgd
bcdd
bce

Notes

Should the DFA not be Acyclic, the output would have no end.