2D regular expressions represent rational relations over two alphabets. In this paper we study the average state complexity of partial derivative standard transducers ) 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 can be, where n is the size of the expression, asymptotically and on average that value is bounded from above by. 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.
CITATION STYLE
Konstantinidis, S., Machiavelo, A., Moreira, N., & Reis, R. (2020). On the Average State Complexity of Partial Derivative Transducers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12011 LNCS, pp. 174–186). Springer. https://doi.org/10.1007/978-3-030-38919-2_15
Mendeley helps you to discover research relevant for your work.