Higher order regular expressions

In this paper we explore possibilities of recursive regular expression construction. Such expressions can contain other expressions as a fundamental element, even recursively contain themselves. We call such expressions higher order functions. A recursive automaton can be constructed from it. We present such automata and show, that they may have infinite states and are able to accept context-free grammars. Higher order nondeterminism is explored as a direct result of higher order regular expressions.