Acta InformaticaDubè, D., Feeley, M.: Efficiently building a parse tree from a regular expression. Acta Inf. 37 (2), 121–144 (2000) MATHD. Dub´e and M. Feeley. Efficiently building a parse tree from a regular expression. Acta Informatica, 37(2):121-144, 2000....
About this paper Cite this paper Fernau, H. (2005). Algorithms for Learning Regular Expressions. In: Jain, S., Simon, H.U., Tomita, E. (eds) Algorithmic Learning Theory. ALT 2005. Lecture Notes in Computer Science(), vol 3734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11...
Acta InformaticaDubè, D., Feeley, M.: Efficiently building a parse tree from a regular expression. Acta Inf. 37 (2), 121–144 (2000) MATHD. Dub´e and M. Feeley. Efficiently building a parse tree from a regular expression. Acta Informatica, 37(2):121-144, 2000....
In Freydenberger, Freydenberger shows that the set of invalid computations of an extended Turing machine can be recognized by a synchronized regular expression [as defined in Delia Penna et al.]. Therefore, the widely discussed predicate "= {0, 1}*" is not recursively enumerable for ...
regular expression/ C4210L Formal languages and computational linguisticsIn general, it is undecidable if an arbitrary context-free grammar has a regular solution. Past work has focused on special cases, such as one-letter grammars, non self-embedded grammars and the finite-language grammars, for ...