Skip to content
Snippets Groups Projects
Select Git revision
  • QuantumLeap
  • ZAutomata-rebase
  • backup-jt
  • clang-tidy-fixes
  • compileTimeTypeRetrievalTest
  • conversions-tests-wip
  • dejmeto1-dp-fta2rte
  • dev-jt
  • dev-tp
  • dev-tp-mp-borderarray-one-indexed
  • dev-tp2
  • dp-doupajak-fta2rteEquations-v2
  • experimental
  • experimentalToSinglePopPDA
  • issue-132-seed
  • libc++
  • libc++-17
  • master default protected
  • merge-jt
  • merge-tp
  • BP-shushiri
  • DP-doupajak
  • esf2018-doc
  • v0.0.0 protected
  • v0.0.1 protected
  • BP-uhlikja2
  • DP-travnja3
  • BP_capekto4
  • BP_cvachmic
  • BP-parmajan
  • BP_shatrale
  • DP_plachste
  • DP-peckatom
  • BP-brozjan5
  • BP-doupajak
  • BP-vozabluk
  • BP-kocicma3
  • BP-cervera3
  • BP-roscadav2
  • BP-plachste
40 results
You can move around the graph by using the arrow keys.
Created with Raphaël 2.2.020Apr18171611103230Mar2827262322211914131210632128Feb27252423222120191815141211108765432131Jan3029262524232221191816159830Dec211511865230Nov28272524232221191615141397654231Oct282625Fix and add simplification axiomsaql: ReadlineCompletion: Add introspect algorithms/datatypes and SET completion.Remove accidental double return callRename simplification axioms to be consistent with other implementationsUpdate FTA2RTE conversions and Unbounded RTE simplifications to work with latest master commitfix arbology test, part2add cast to SetOfObjectPairsfix arbology testsadd value printing of vector < int >random tree automaton generatoroperator = and copy constructor for ranked_symbolData: FormalRTE minor improvementsExamples of DFTAsAlgo: Normalize DFTAadd basic rte optimize functionalityuse distinguishable states in minimisation algoundistinguishable states - new FTA, tiny redesign DFAAux: Simple DotConverter for RTEs and ExtendedNFTAData: ExtendedNFTAfix header guardsregister and fix DFTA to NFTA castunify renaming code of FTAstiny optimizeuse multimap in NFTAredesign NFTA determinisation algoadd rename algo for DFTA and NFTA automataadd equal_range override to mapredesign StateType, SymbolType retrieval from FSMsunify code in automaton rename algounify some algorithm codeadd typedef fields to automata datatypes for template parametersdrop usages of shared_ptr in static initialisaionuse move semantics in compactionuse require in compaction algo and implement it for NFafix compaction algoadd and test use automata detection traitsuse multimap in multi initial state epsilon nfaremove not needed specialisationuse multimap in CompactNFAuse multimap in Extended nfa