On expressive power of regular expressions over infinite orders

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Two fundamental results of classical automata theory are the Kleene theorem and the Büchi-Elgot-Trakhtenbrot theorem. Kleene’s theorem states that a language of finite words is definable by a regular expression iff it is accepted by a finite state automaton. Büchi-Elgot- Trakhtenbrot’s theorem states that a language of finite words is accepted by a finite-state automaton iff it is definable in the weak monadic secondorder logic. Hence, the weak monadic logic and regular expressions are expressively equivalent over finite words. We generalize this to words over arbitrary linear orders.

Original languageEnglish
Title of host publicationComputer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, Proceedings
EditorsGerhard J. Woeginger, Alexander S. Kulikov
Pages382-393
Number of pages12
DOIs
StatePublished - 2016
Event11th International Computer Science Symposium in Russia, CSR 2016 - St. Petersburg, Russian Federation
Duration: 9 Jun 201613 Jun 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9691

Conference

Conference11th International Computer Science Symposium in Russia, CSR 2016
Country/TerritoryRussian Federation
CitySt. Petersburg
Period9/06/1613/06/16

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On expressive power of regular expressions over infinite orders'. Together they form a unique fingerprint.

Cite this