default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlavio D'Alessandro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Andrea Benso, Flavio D'Alessandro
, Paolo Papi:
Quantum Automata and Languages of Finite Index. RP 2024: 88-103- [i13]Andrea Benso, Flavio D'Alessandro, Paolo Papi:
Quantum automata and languages of finite index. CoRR abs/2406.13797 (2024) - 2023
- [c17]Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche:
Unboundedness Problems for Machines with Reversal-Bounded Counters. FoSSaCS 2023: 240-264 - [i12]Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche:
Unboundedness problems for machines with reversal-bounded counters. CoRR abs/2301.10198 (2023) - 2022
- [i11]Arturo Carpi, Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
Relationships Between Bounded Languages, Counter Machines, Finite-Index Grammars, Ambiguity, and Commutative Regularity. CoRR abs/2212.03359 (2022) - 2021
- [j32]Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
On finite-index indexed grammars and their restrictions. Inf. Comput. 279: 104613 (2021) - [j31]Arturo Carpi, Flavio D'Alessandro:
On the Commutative Equivalence of Algebraic Formal Series and Languages. Int. J. Found. Comput. Sci. 32(4): 341-367 (2021) - [j30]Arturo Carpi, Flavio D'Alessandro:
On bounded linear codes and the commutative equivalence. Theor. Comput. Sci. 852: 185-196 (2021) - [j29]Arturo Carpi, Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity. Theor. Comput. Sci. 862: 97-118 (2021) - 2020
- [j28]Arturo Carpi, Flavio D'Alessandro:
Coding by minimal linear grammars. Theor. Comput. Sci. 834: 14-25 (2020)
2010 – 2019
- 2019
- [j27]Arturo Carpi, Flavio D'Alessandro:
Locally Strongly Transitive Automata in the Černý Conjecture and Related Problems. J. Autom. Lang. Comb. 24(2-4): 165-184 (2019) - [c16]Arturo Carpi, Flavio D'Alessandro:
On the Commutative Equivalence of Bounded Semi-linear Codes. WORDS 2019: 119-132 - 2018
- [j26]Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Language classes associated with automata over matrix groups. RAIRO Theor. Informatics Appl. 52(2-3-4): 253-268 (2018) - [c15]Arturo Carpi, Flavio D'Alessandro:
On the Commutative Equivalence of Context-Free Languages. DLT 2018: 169-181 - [i10]Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Language Classes Associated With Automata Over Matrix Groups. CoRR abs/1810.12415 (2018) - 2017
- [j25]Arturo Carpi, Flavio D'Alessandro:
On incomplete and synchronizing finite sets. Theor. Comput. Sci. 664: 67-77 (2017) - [c14]Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
On Finite-Index Indexed Grammars and Their Restrictions. LATA 2017: 287-298 - [c13]Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Generalized Results on Monoids as Memory. AFL 2017: 234-247 - 2016
- [j24]Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro:
Homing vector automata. RAIRO Theor. Informatics Appl. 50(4): 371-386 (2016) - [c12]Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Language classes associated with automata over matrix groups. NCMA 2016: 287-300 - [i9]Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro:
Homing vector automata. CoRR abs/1603.09185 (2016) - [i8]Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Language Classes Associated with Automata Over Matrix Groups. CoRR abs/1609.00396 (2016) - [i7]Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
On Finite-Index Indexed Grammars and Their Restrictions. CoRR abs/1610.06366 (2016) - [i6]Arturo Carpi, Flavio D'Alessandro:
On incomplete and synchronizing finite sets. CoRR abs/1612.07881 (2016) - 2015
- [j23]Flavio D'Alessandro, Benedetto Intrigila:
On the commutative equivalence of bounded context-free and regular languages: The code case. Theor. Comput. Sci. 562: 304-319 (2015) - [j22]Flavio D'Alessandro, Benedetto Intrigila:
On the commutative equivalence of semi-linear sets of Nk. Theor. Comput. Sci. 562: 476-495 (2015) - [j21]Flavio D'Alessandro, Benedetto Intrigila:
On the commutative equivalence of bounded context-free and regular languages: The semi-linear case. Theor. Comput. Sci. 572: 1-24 (2015) - 2014
- [j20]Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro:
On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages. Int. J. Found. Comput. Sci. 25(8): 1065-1082 (2014) - [c11]Arturo Carpi, Flavio D'Alessandro:
Cerny-like problems for finite sets of words. ICTCS 2014: 81-92 - 2013
- [j19]Arturo Carpi, Flavio D'Alessandro:
Independent sets of words and the synchronization problem. Adv. Appl. Math. 50(3): 339-355 (2013) - [c10]Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro:
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem. Developments in Language Theory 2013: 82-93 - [i5]Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro:
Quantum finite automata and linear context-free languages: a decidable problem. CoRR abs/1303.2967 (2013) - 2012
- [j18]Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro:
Regularity of languages defined by formal series with isolated cut point. RAIRO Theor. Informatics Appl. 46(4): 479-493 (2012) - [j17]Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:
Quasi-polynomials, linear Diophantine equations and semi-linear sets. Theor. Comput. Sci. 416: 1-16 (2012) - 2011
- [c9]Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro:
Regularity of Languages Defined by Formal Series with Isolated Cut Point. NCMA 2011: 73-87 - [i4]Arturo Carpi, Flavio D'Alessandro:
Independent sets of words and the synchronization problem. CoRR abs/1111.5467 (2011) - 2010
- [j16]Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio:
On Bounded Rational Trace Languages. Theory Comput. Syst. 46(2): 351-369 (2010) - [c8]Arturo Carpi, Flavio D'Alessandro:
On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths. Developments in Language Theory 2010: 124-135
2000 – 2009
- 2009
- [j15]Arturo Carpi, Flavio D'Alessandro:
Strongly transitive automata and the Cerný conjecture. Acta Informatica 46(8): 591-607 (2009) - [j14]Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:
The Parikh counting functions of sparse context-free languages are quasi-polynomials. Theor. Comput. Sci. 410(47-49): 5158-5181 (2009) - [c7]Arturo Carpi, Flavio D'Alessandro:
Synchronizing Automata and Independent Systems of Words. ICTCS 2009: 71-74 - [c6]Arturo Carpi, Flavio D'Alessandro:
The Synchronization Problem for Locally Strongly Transitive Automata. MFCS 2009: 211-222 - [i3]Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:
On some counting problems for semi-linear sets. CoRR abs/0907.3005 (2009) - 2008
- [j13]Flavio D'Alessandro, Stefano Varricchio:
On the Growth of Context-Free Languages. J. Autom. Lang. Comb. 13(2): 95-104 (2008) - [c5]Flavio D'Alessandro, Stefano Varricchio:
Well Quasi-orders in Formal Language Theory. Developments in Language Theory 2008: 84-95 - [c4]Arturo Carpi, Flavio D'Alessandro:
The Synchronization Problem for Strongly Transitive Automata. Developments in Language Theory 2008: 240-251 - [i2]Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:
The Parikh functions of sparse context-free languages are quasi-polynomials. CoRR abs/0807.0718 (2008) - 2007
- [j12]Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well quasi-orders generated by a word-shuffle rewriting. Theor. Comput. Sci. 377(1-3): 73-92 (2007) - [j11]Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio:
On the separability of sparse context-free languages and of bounded rational relations. Theor. Comput. Sci. 381(1-3): 274-279 (2007) - 2006
- [j10]Flavio D'Alessandro, Alessandro D'Andrea:
A Non-commutativity Statement for Algebraic Quaternions. Int. J. Algebra Comput. 16(3): 583-602 (2006) - [j9]Flavio D'Alessandro, Stefano Varricchio:
Well quasi-orders, unavoidable sets, and derivation systems. RAIRO Theor. Informatics Appl. 40(3): 407-426 (2006) - [j8]Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:
On the structure of the counting function of sparse context-free languages. Theor. Comput. Sci. 356(1-2): 104-117 (2006) - [c3]Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well Quasi Orders and the Shuffle Closure of Finite Sets. Developments in Language Theory 2006: 260-269 - [i1]Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well quasi-orders and the shuffle closure of finite sets. CoRR abs/cs/0607082 (2006) - 2004
- [j7]Flavio D'Alessandro:
Free Groups of Quaternions. Int. J. Algebra Comput. 14(1): 69-86 (2004) - [j6]Flavio D'Alessandro, Stefano Varricchio:
Well quasi-orders and context-free grammars. Theor. Comput. Sci. 327(3): 255-268 (2004) - [c2]Flavio D'Alessandro, Stefano Varricchio:
Avoidable Sets and Well Quasi-Orders. Developments in Language Theory 2004: 139-150 - 2003
- [j5]Flavio D'Alessandro:
On the Complexity of Simon Automata over the Dyck Language. J. Autom. Lang. Comb. 8(3): 465-476 (2003) - [j4]Flavio D'Alessandro, Jacques Sakarovitch:
The finite power property in free groups. Theor. Comput. Sci. 293(1): 55-82 (2003) - [c1]Flavio D'Alessandro, Stefano Varricchio:
On Well Quasi-orders on Languages. Developments in Language Theory 2003: 230-241 - 2002
- [j3]Flavio D'Alessandro:
A combinatorial problem on Trapezoidal words. Theor. Comput. Sci. 273(1-2): 11-33 (2002)
1990 – 1999
- 1998
- [j2]Christian Choffrut, Flavio D'Alessandro:
Commutativity in Free Inverse Monoids. Theor. Comput. Sci. 204(1-2): 35-54 (1998) - 1997
- [j1]Flavio D'Alessandro:
A Note on the Multiplicative Group of a Division Ring. Int. J. Algebra Comput. 7(1): 51-54 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
