• DocumentCode
    2022302
  • Title

    Regular expressions in process algebra

  • Author

    Baeten, J.C.M. ; Corradini, F.

  • Author_Institution
    Dept. of Comput. Sci., Technische Univ. Eindhoven, Netherlands
  • fYear
    2005
  • fDate
    26-29 June 2005
  • Firstpage
    12
  • Lastpage
    19
  • Abstract
    We tackle an open question of Milner (1984). We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions.
  • Keywords
    bisimulation equivalence; finite automata; formal languages; process algebra; set theory; finite automata; modulo bisimulation equivalence; process algebra; regular expression; set theory; Algebra; Automata; Carbon capture and storage; Computer science; Formal languages; Logic; Mathematics; System recovery;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 2005. LICS 2005. Proceedings. 20th Annual IEEE Symposium on
  • ISSN
    1043-6871
  • Print_ISBN
    0-7695-2266-1
  • Type

    conf

  • DOI
    10.1109/LICS.2005.43
  • Filename
    1509205
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2022302