1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170

use std::collections::hash_map::RandomState;
use std::collections::HashMap;
use std::fmt::Debug;
use std::hash::Hash;
use std::iter::FromIterator;

#[derive(Debug)]
pub struct FSA<'a, Q> {
    accept_states: &'a [Q],
    transition_matrix: Vec<Vec<Option<Q>>>,
    start_state: Q,
    state_to_index: HashMap<Q, usize, RandomState>,
    symbol_to_index: HashMap<String, usize, RandomState>,
}

pub struct Transition<Q, S> {
    from: Q,
    to: Q,
    on: Vec<S>,
}

#[macro_export]
macro_rules! transitions {
    [$(([$($symbol:expr),+], $from:expr) => $to:expr),+] => {
        vec![
            $(
                transition!(([$($symbol),+], $from) => $to)
            ),+
        ]
    };
    [$(($symbol:expr, $from:expr) => $to:expr),+] => {
        vec![
            $(
                transition!(($symbol, $from) => $to)
            ),+
        ]
    }
}

macro_rules! transition {
    (([$($symbol:expr),+], $from:expr) => $to:expr) => {
        Transition {
            from: $from,
            to: $to,
            on: vec![$($symbol),+]
        }
    };
    (($symbol:expr, $from:expr) => $to:expr) => {
        Transition {
            from: $from,
            to: $to,
            on: vec![$symbol]
        }
    }
}

impl<'a, Q: Debug + Eq + Hash + Clone> FSA<'a, Q> {
    pub fn new<S: ToString>(
        states: &'a [Q],
        symbols: &'a [S],
        start_state: Q,
        accept_states: &'a [Q],
        transitions: Vec<Transition<Q, S>>,
    ) -> Self {
        assert!(states.contains(&start_state));
        assert!(
            accept_states.iter().all(|state| states.contains(state))
                && accept_states.len() <= states.len()
        );

        let state_to_index = HashMap::from_iter(
            states
                .into_iter()
                .enumerate()
                .map(|(index, state)| (state.clone(), index)),
        );
        let symbol_to_index = HashMap::from_iter(
            symbols
                .into_iter()
                .enumerate()
                .map(|(index, symbol)| (symbol.to_string(), index)),
        );
        let mut fsa = Self {
            start_state,
            accept_states,
            transition_matrix: vec![vec![None; symbols.len()]; states.len()],
            state_to_index,
            symbol_to_index,
        };
        for transition in transitions {
            fsa.add_transition(transition);
        }
        fsa
    }

    fn add_transition<S: ToString>(&mut self, transition: Transition<Q, S>) {
        let from_index = self.state_to_index[&transition.from];
        for symbol in transition.on {
            let symbol_index = self.symbol_to_index[&symbol.to_string()];
            self.transition_matrix[from_index][symbol_index].replace(transition.to.clone());
        }
    }

    pub fn accepts<P: ToString + Hash + Eq, T: Iterator<Item = P>>(&self, tape: T) -> bool {
        let index_to_item: HashMap<usize, T::Item, RandomState> =
            HashMap::from_iter(tape.into_iter().enumerate());

        let length = index_to_item.len();
        let mut current_input_index = 0;
        let mut current_state = self.start_state.clone();

        loop {
            if current_input_index == length {
                return self.accept_states.contains(&current_state);
            } else {
                let current_state_index = self.state_to_index[&current_state];
                let current_symbol = index_to_item[&current_input_index].to_string();
                match self.symbol_to_index.get(&current_symbol) {
                    Some(current_symbol_index) => {
                        match &self.transition_matrix[current_state_index][*current_symbol_index] {
                            None => return false,
                            Some(next_state) => {
                                current_state = next_state.clone();
                                current_input_index += 1;
                            }
                        }
                    }
                    None => return false, // if the character isn't in the language's alphabet
                }
            }
        }
    }

    pub fn rejects<P: ToString + Hash + Eq, T: Iterator<Item = P>>(&self, tape: T) -> bool {
        !self.accepts(tape)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    #[test]
    fn sheeptalk() {
        //           INPUT
        // STATE   b   a   !
        //   0     1   ∅   ∅
        //   1     ∅   2   ∅
        //   2     ∅   3   ∅
        //   3     ∅   3   4
        //   4:    ∅   ∅   ∅
        let fsa = FSA::new(
            &[0, 1, 2, 3, 4],
            &['b', 'a', '!'],
            0,
            &[4],
            transitions![
                 ('b', 0) => 1,
                 ('a', 1) => 2,
                 ('a', 2) => 3,
                 ('a', 3) => 3,
                 ('!', 3) => 4
            ],
        );

        assert!(fsa.accepts("baa!".chars()));
        assert!(fsa.rejects("ba!".chars()));
        assert!(fsa.accepts("baaaaa!".chars()));
        assert!(fsa.rejects(1234345.to_string().chars()));
    }
}