Go to:
Logótipo
You are here: Start > Publications > View > ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
Today is sunday
Inauguração da Exposição A Velha Escola Morreu
Publication

ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA

Title
ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
Type
Article in International Scientific Journal
Year
2012
Authors
Sabine Broda
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Antonio Machiavelo
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Nelma Moreira
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Rogerio Reis
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Journal
Vol. 23
Pages: 969-984
ISSN: 0129-0541
Publisher: World Scientific
Scientific classification
FOS: Natural sciences > Computer and information sciences
Other information
Authenticus ID: P-002-74A
Abstract (EN): In this paper, the relation between the Glushkov automaton (A(pos)) and the partial derivative automaton (A(pd)) of a given regular expression, in terms of transition complexity, is studied. The average transition complexity of A(pos) was proved by Nicaud to be linear in the size of the corresponding expression. This result was obtained using an upper bound of the number of transitions of A(pos). Here we present a new quadratic construction of A(pos) that leads to a more elegant and straightforward implementation, and that allows the exact counting of the number of transitions. Based on that, a better estimation of the average size is presented. Asymptotically, and as the alphabet size grows, the number of transitions per state is on average 2. Broda et al. computed an upper bound for the ratio of the number of states of A(pd) to the number of states of A(pos), which is about 1/2 for large alphabet sizes. Here we show how to obtain an upper bound for the number of transitions in A(pd), which we then use to get an average case approximation. In conclusion, assymptotically, and for large alphabets, the size of Apd is half the size of the . This is corroborated by some experiments, even for small alphabets and small regular expressions.
Language: English
Type (Professor's evaluation): Scientific
Contact: sbb@dcc.fc.up.pt; ajmachia@fc.up.pt; nam@dcc.fc.up.pt; rvr@dcc.fc.up.pt
No. of pages: 16
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

On the average size of pd automata: an analytic combinatorics approach (2010)
Technical Report
Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis
On the average size of Glushkov and partial derivative automata (2011)
Technical Report
Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis
Partial Derivative Automaton for Regular Expressions with Shuffle (2015)
Other Publications
Broda, S; António Machiavelo; Nelma Moreira; Rogério Reis
On the Uniform Distribution of Regular Expressions (2021)
Other Publications
Broda, S; António Machiavelo; Nelma Moreira; Rogério Reis
Position Automata for Semi-extended Expressions (2018)
Article in International Scientific Journal
Broda, S; António Machiavelo; Nelma Moreira; Rogério Reis

See all (27)

Of the same journal

25th International Conference on Developments in Language Theory (DLT 2021): Preface (2023)
Another Publication in an International Scientific Journal
Nelma Moreira; Rogério Reis
SPECIAL ISSUE IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2012) (2013)
Another Publication in an International Scientific Journal
Nelma Moreira; Rogerio Reis
SpliceTAPyR - An Efficient Method for Transcriptome Alignment (2018)
Article in International Scientific Journal
Teixeira, AS; Fernandes, F; Francisco, AP
Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels (2020)
Article in International Scientific Journal
Konstantinidis, S; Nelma Moreira; Rogério Reis; Young, J
Preface (2014)
Article in International Scientific Journal
Helmut Jurgensen; Rogério Reis

See all (14)

Recommend this page Top
Copyright 1996-2024 © Faculdade de Engenharia da Universidade do Porto  I Terms and Conditions  I Accessibility  I Index A-Z  I Guest Book
Page generated on: 2024-11-03 at 23:51:06 | Acceptable Use Policy | Data Protection Policy | Complaint Portal