Skip to main content

From \(\omega \)-Regular Expressions to Büchi Automata via Partial Derivatives

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8977))

Abstract

We extend Brzozowski derivatives and partial derivatives from regular expressions to \(\omega \)-regular expressions and establish their basic properties. We observe that the existing derivative-based automaton constructions do not scale to \(\omega \)-regular expressions. We define a new variant of the partial derivative that operates on linear factors and prove that this variant gives rise to a translation from \(\omega \)-regular expressions to nondeterministic Büchi automata.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antimirov, V.M.: Rewriting regular inequalities. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 116–125. Springer, Heidelberg (1995)

    Google Scholar 

  2. Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theoretical Computer Science 155(2), 291–319 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481–494 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  4. Caron, P., Champarnaud, J.-M., Mignot, L.: Partial derivatives of an extended regular expression. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 179–191. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Kleene, S.C.: Representation of events in nerve nets and finite automata. Automata Studies (1956)

    Google Scholar 

  6. Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Theoretical Computer Science. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Redziejowski, R.R.: Construction of a deterministic \(\omega \)-automaton using derivatives. Informatique Théorique et Applications 33(2), 133–158 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Redziejowski, R.R.: An improved construction of deterministic omega-automaton using derivatives. Fundam. Inform. 119(3–4), 393–406 (2012)

    MATH  MathSciNet  Google Scholar 

  9. Roşu, G., Viswanathan, M.: Testing extended regular language membership incrementally by rewritin. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 499–514. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Thiemann .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Thiemann, P., Sulzmann, M. (2015). From \(\omega \)-Regular Expressions to Büchi Automata via Partial Derivatives. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15579-1_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15578-4

  • Online ISBN: 978-3-319-15579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics