Repository navigation
Distromaton, xor automata, and the universal automaton; their shift presentations - #65
Merged
Merged
Conversation
…resentations Completes the canonical NFAs of Myers, Adamek, Milius & Urbat (CMCS 2014) and Zetzsche, van Heerdt, Sammartino & Silva (MFPS 2021): Distromaton, minimal_xor_automaton, xor_caba_automaton, UniversalAutomaton, minimal_structured_dfa and is_intersection_closed, all exact via the atom representation (sets of states of the minimal DFA of the reversed language). Adds XorAutomaton (parity acceptance), distromaton and universal shift presentations, follower_sets_intersection_closed (certifies the canonical RFSA presentation is smallest), and the class-minimality of canonical_rfsa_hmm.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Completes the canonical NFAs of two papers and carries them over to shifts and HMMs where that makes sense:
Both build canonical NFAs by closing the residuals under the operations of an algebra and taking a minimal set of generators as states.
soficalready had the canonical RFSA (the papers' jiromaton), the átomaton, and the maximized prime átomaton.Automata: new module
sofic.automata.canonical.closuresDistromaton,distromaton_from_languageminimal_xor_automaton, plus a newsofic.automata.xor.XorAutomaton(parity acceptance)xor_caba_automaton(basis="residuals" | "atoms")UniversalAutomatonminimal_structured_dfa(language, variety)is_intersection_closedAll constructions are exact. Every closure element is a union of atoms, and the atoms are the states of the minimal DFA of the reversed language, so each language is stored as a set of those states: derivatives are preimages, and union, intersection and symmetric difference are set operations.
XorAutomatonis not aLabeledAutomaton, because that base class's language operations (emptiness, inclusion, union,reverse) assume NFA acceptance. Language operations go throughdeterminize().Shifts
distromaton_presentationanduniversal_presentation, also available asSoficShiftmethods.follower_sets_intersection_closed: when it holds,canonical_rfsa_presentationhas the fewest states of any presentation (Thm 4.4 plus the fact that a smallest presentation is essential). Brute-force tested against every smaller labeled graph.HMMs
canonical_rfsa_hmm(andmaximized_prime_atomaton_hmmin reverse time) has the fewest states among generators whose state morphs are mixtures of causal-state morphs. This is the stochastic counterpart of the canonical RFSA's minimality. The argument is new, not from the literature.minimal_quasi_realization.Tests
-W, andtyreports no new diagnostics.Two errata in the papers