• DocumentCode
    722743
  • Title

    Higher order regular expressions

  • Author

    Sicak, Michal

  • Author_Institution
    Dept. of Comput. & Inf., Tech. Univ. of Kosice, Kosice, Slovakia
  • fYear
    2015
  • fDate
    11-12 June 2015
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    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.
  • Keywords
    automata theory; context-free grammars; context-free grammars; higher order nondeterminism; higher order regular expressions; infinite states; recursive automaton; recursive regular expression construction; Automata; Computer languages; Context; Data structures; Genetic programming; Grammar; Optimized production technology; formal grammars; higher order regular expressions; recursive regular expressions; recursive state automata;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Engineering of Modern Electric Systems (EMES), 2015 13th International Conference on
  • Conference_Location
    Oradea
  • Print_ISBN
    978-1-4799-7649-2
  • Type

    conf

  • DOI
    10.1109/EMES.2015.7158427
  • Filename
    7158427
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=722743