I-LaSer answers questions about regular languages and independent properties - prefix code property, suffix code property, ..., various error-detection and error-correction properties.
- Satisfaction question:
Given language L and property P, does L satisfy P?
- Maximality question:
Given language L and property P, is L maximal with respect to P?
- Construction question:
Given property P and integers N,k>0, return a language of N words of length k satisfying P.
- Approximate Maximality question:
Given language L, property P, and ε is the language (1-ε) close to being maximal?
Quick Notes (click on the "Technical Notes" tab for details): Languages are provided by automata; properties are either fixed, or provided by transducers or trajectory expressions. The
alphabets of the given property and the language involved
must be the same. The computation of the Construction question produces languages over an alphabet of the form {0,1,...,s} with 2 ≤ s ≤ 10. This is the LaSer local web version. There are no time limits or computation limits in this version.