Skip to main content

On the Average State Complexity of Partial Derivative Transducers

  • Conference paper
  • First Online:
SOFSEM 2020: Theory and Practice of Computer Science (SOFSEM 2020)

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

Abstract

2D regular expressions represent rational relations over two alphabets. In this paper we study the average state complexity of partial derivative standard transducers (\(\mathcal {T}_{\text {PD}}\)) that can be defined for (general) 2D expressions where basic terms are pairs of ordinary regular expressions (1D). While in the worst case the number of states of \(\mathcal {T}_{\text {PD}}\) can be \(O(n^2)\), where n is the size of the expression, asymptotically and on average that value is bounded from above by \(O(n^{\frac{3}{2}})\). Moreover, asymptotically and on average the alphabetic size of a 2D expression is half of the size of that expression. All results are obtained in the framework of analytic combinatorics considering generating functions of parametrised combinatorial classes defined implicitly by algebraic curves. In particular, we generalise the methods developed in previous work to a broad class of analytic functions.

This work was partially supported by NSERC, Canada and CMUP (UID/MAT/00144/2019), which is funded by FCT, FEDER, and PT2020.

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 EPUB and 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

Notes

  1. 1.

    Extending partial derivatives w.r.t. words, one could also define \({\mathsf {PD}}(r)=\bigcup _{w\in \varSigma ^\star }\partial _w(\mathbf{r} )\).

  2. 2.

    This follows from the definition above.

  3. 3.

    I.e. \([z^n]G_k(z)\) gives the number of expressions \(\mathbf{g} \) of size n.

References

  1. Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155(2), 291–319 (1996)

    Article  MathSciNet  Google Scholar 

  2. Bastos, R., Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average complexity of partial derivative automata for semi-extended expressions. J. Autom. Lang. Comb. 22(1–3), 5–28 (2017)

    MathSciNet  MATH  Google Scholar 

  3. Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average state complexity of partial derivative automata: an analytic combinatorics approach. Int. J. Found. Comput. Sci. 22(7), 1593–1606 (2011)

    Article  MathSciNet  Google Scholar 

  4. Broda, S., Machiavelo, A., Moreira, N., Reis, R.: A Hitchhiker’s Guide to descriptional complexity through analytic combinatorics. Theoret. Comput. Sci. 528, 85–100 (2014)

    Article  MathSciNet  Google Scholar 

  5. Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Automata for regular expressions with shuffle. Inf. Comput. 259(2), 162–173 (2018)

    Article  MathSciNet  Google Scholar 

  6. Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On average behaviour of regular expressions in strong star normal form. Int. J. Found. Comput. Sci. 30(6–7), 899–920 (2019)

    Article  MathSciNet  Google Scholar 

  7. Demaille, A.: Derived-term automata of multitape expressions with composition. Sci. Ann. Comput. Sci. 27(2), 137–176 (2017)

    MathSciNet  MATH  Google Scholar 

  8. Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2008)

    MATH  Google Scholar 

  9. Ghys, É.: A Singular Mathematical Promenade. ENS Éditions, Lyon (2017)

    MATH  Google Scholar 

  10. Hille, E.: Analytic Function Theory, vol. 2. Blaisdell Publishing Company, New York (1962)

    MATH  Google Scholar 

  11. Konstantinidis, S., Moreira, N., Pires, J., Reis, R.: Partial derivatives of regular expressions over alphabet-invariant and user-defined labels. In: Hospodár, M., Jirásková, G. (eds.) CIAA 2019. LNCS, vol. 11601, pp. 184–196. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-23679-3_15

    Chapter  Google Scholar 

  12. Konstantinidis, S., Moreira, N., Reis, R., Young, J.: Regular expressions and transducers over alphabet-invariant and user-defined labels. In: Câmpeanu, C. (ed.) CIAA 2018. LNCS, vol. 10977, pp. 4–27. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94812-6_2

    Chapter  MATH  Google Scholar 

  13. Lang, S.: Algebra. Graduate Texts in Mathematics, vol. 211, 3rd edn. Springer, New York (2002). https://doi.org/10.1007/978-1-4613-0041-0

    Book  MATH  Google Scholar 

  14. Lombardy, S., Sakarovitch, J.: Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. 332(1–3), 141–177 (2005)

    Article  MathSciNet  Google Scholar 

  15. Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Eng. Cybern. 5, 51–57 (1966)

    Google Scholar 

  16. Nicaud, C.: On the average size of Glushkov’s automata. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 626–637. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00982-2_53

    Chapter  MATH  Google Scholar 

  17. Walker, R.J.: Algebraic Curves. Princeton University Press, Princeton (1950)

    MATH  Google Scholar 

  18. Wall, C.T.C.: Singular Points of Plane Curves. No. 63 in London Mathematical Society Student Texts. Cambridge University Press, Cambridge (2004)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rogério Reis .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Konstantinidis, S., Machiavelo, A., Moreira, N., Reis, R. (2020). On the Average State Complexity of Partial Derivative Transducers. In: Chatzigeorgiou, A., et al. SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020. Lecture Notes in Computer Science(), vol 12011. Springer, Cham. https://doi.org/10.1007/978-3-030-38919-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-38919-2_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-38918-5

  • Online ISBN: 978-3-030-38919-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics