issues
search
subttle
/
regular
Finite Automata and Regular Expressions for Regular Languages in Haskell
BSD 3-Clause "New" or "Revised" License
10
stars
1
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Explicit testing of generated sequences which can be checked using external resource
#14
subttle
closed
3 years ago
0
Benchmarking
#13
subttle
opened
3 years ago
0
Please, publish to hackage
#12
safinaskar
closed
3 years ago
3
Non-Empty set from Contravariant.Adjuction use cases
#11
subttle
opened
4 years ago
0
Contravariant hierarchy
#10
subttle
opened
4 years ago
3
Transition Monoid for DFA?
#9
subttle
opened
5 years ago
1
Divisible/Decidable instances for DA
#8
subttle
opened
5 years ago
5
Interactions with non-regular language formalisms
#7
subttle
closed
4 years ago
0
Agda RE proofs
#6
subttle
closed
4 years ago
0
RE and ERE axiomization
#5
subttle
closed
4 years ago
3
Diagrams for Drawing Automata
#4
subttle
closed
4 years ago
0
Testing Suite
#3
subttle
closed
5 years ago
2
Changes to Config.hs
#2
subttle
opened
5 years ago
1
Restructuring
#1
subttle
opened
5 years ago
0