User Portlet User Portlet

Discussions
The regular grammar will be:G = ({1,a,b},{S,A,B,C,D}, P, S) , where P: S -> 1A A -> aB|aC B -> 1B|aB|bB|aC C -> a|aD D -> 1|a|b|1D|aD|bD
It works. But is there a way to filter those names to view only those that start with the letter "m"? I'm interested in ability of WolframAlpha to make exact queries like SQL does.