# Revision history [back]

### Regular Languages in Sage?

I see there's a package for automata, but is there a way to work directly with regular languages? For instance, is there an option for seeing which strings are carved out by (ac+b)c? What about finding a machine associated to that regular expression? Is there a way to work with rational series? I would love to be able to expand out something like (ac+b)c as a rational function (in noncommuting variables) (1 - (ac+b))^(-1)c, then take a series expansion, but I can't find any documentation on noncommuting power series (though I did find something on noncommuting polynomials, which I could probably leverage by expanding out kleene stars far enough by hand).

I feel like regular languages are such a fundamental topic in CS, and a lot of computational results are known, that some of it _must_ be implemented already. Any advice would be fantastic! Thanks in advance ^_^.

### Regular Languages in Sage?

I see there's a package for automata, but is there a way to work directly with regular languages? For instance, is there an option for seeing which strings are carved out by (ac+b)c? What about finding a machine associated to that regular expression? Is there a way to work with rational series? I would love to be able to expand out something like (ac+b)c as a rational function (in noncommuting variables) (1 - (ac+b))^(-1)c, then take a series expansion, but I can't find any documentation on noncommuting power series (though I did find something on noncommuting polynomials, which I could probably leverage by expanding out kleene stars far enough by hand).

I feel like regular languages are such a fundamental topic in CS, and a lot of computational results are known, that some of it _must_ be implemented already. Any advice would be fantastic!

### Regular Languages in Sage?

I see there's a package for automata, but is there a way to work directly with regular languages? For instance, is there an option for seeing which strings are carved out by (ac+b)c? (ac+b)*c? What about finding a machine associated to that regular expression? Is there a way to work with rational series? I would love to be able to expand out something like (ac+b)c (ac+b)*c as a rational function (in noncommuting variables) (1 - (ac+b))^(-1)c, then take a series expansion, but I can't find any documentation on noncommuting power series (though I did find something on noncommuting polynomials, which I could probably leverage by expanding out kleene stars far enough by hand).

I feel like regular languages are such a fundamental topic in CS, and a lot of computational results are known, that some of it _must_ be implemented already. Any advice would be fantastic!