package safa
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
On This Page
  
  
  Symbolic Algorithms for Finite Automata
Install
    
    dune-project
 Dependency
Authors
Maintainers
Sources
  
    
      safa-1.4.tgz
    
    
        
    
  
  
  
    
  
  
    
  
        sha256=bcc544e40ae573019fb240d4d819bf779318f0747968fd3c7b9995b327ad082c
    
    
  md5=0b656277d7c80c04db7b0de26ef24244
    
    
  Description
This OCaml library contains symbolic algorithms for checking language equivalence or inclusion of automata with a large alphabet, using symbolic representations (BDDs).
It is described in the following paper, in Proc. POPL'15 http://doi.acm.org/10.1145/2676726.2677007 https://hal.archives-ouvertes.fr/hal-01021497v2/document
This library can be used to obtain symbolic algorithms for Kleene algebra with tests (KAT), see library [symkat]
Published: 02 Feb 2016
Dependencies (3)
- 
  
    ocamlbuild
  
  
    build
- 
  
    ocamlfind
  
  
    build
- 
  
    ocaml
  
  
    >= "4.02.0"
Dev Dependencies
None
Used by (1)
- 
  
    symkat
  
  
    >= "1.4"
Conflicts
None
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
  On This Page