cljx.clj

(defn- queue []
  #+clj clojure.lang.PersistentQueue/EMPTY
  #+cljs cljs.core/PersistentQueue.EMPTY)

(defn matching-inputs
  "Returns a lazy sequence of input sequences which the automaton will match."
  [fsm]
  (let [fsm (-> fsm ->dfa final-minimize)
        accept? (set (accept fsm))
        q (atom (conj (queue) [(start fsm) []]))]
    (take-while
      #(not (identical? ::none %))
      (repeatedly
        (fn []
          (loop []
            (if-let [[state path] (peek @q)]
              (do
                (swap! q pop)
                (doseq [[i s] (input->state fsm state)]
                  (swap! q conj [s (conj path i)]))
                (if (accept? state)
                  path
                  (recur)))
              ::none)))))))

  (let [fsm (-> fsm ->dfa final-minimize)
        accept? (set (accept fsm))
        q #+clj clojure.lang.PersistentQueue/EMPTY #+cljs cljs.core/PersistentQueue.EMPTY
        q (atom (conj q [(start fsm) []]))]
...)