default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArturo Carpi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i4]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
- [j44]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) - [j43]Arturo Carpi, Flavio D'Alessandro:
On bounded linear codes and the commutative equivalence. Theor. Comput. Sci. 852: 185-196 (2021) - [j42]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
- [j41]Arturo Carpi, Flavio D'Alessandro:
Coding by minimal linear grammars. Theor. Comput. Sci. 834: 14-25 (2020) - [c14]Antonio Boccuto, Arturo Carpi:
Repetitions in Toeplitz Words and the Thue Threshold. CiE 2020: 264-276
2010 – 2019
- 2019
- [j40]Antonio Boccuto, Arturo Carpi:
On the length of uncompletable words in unambiguous automata. RAIRO Theor. Informatics Appl. 53(3-4): 115-123 (2019) - [j39]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) - [c13]Arturo Carpi, Flavio D'Alessandro:
On the Commutative Equivalence of Bounded Semi-linear Codes. WORDS 2019: 119-132 - 2018
- [c12]Arturo Carpi, Flavio D'Alessandro:
On the Commutative Equivalence of Context-Free Languages. DLT 2018: 169-181 - 2017
- [j38]Arturo Carpi, Flavio D'Alessandro:
On incomplete and synchronizing finite sets. Theor. Comput. Sci. 664: 67-77 (2017) - 2016
- [i3]Arturo Carpi, Flavio D'Alessandro:
On incomplete and synchronizing finite sets. CoRR abs/1612.07881 (2016) - 2014
- [c11]Arturo Carpi, Flavio D'Alessandro:
Cerny-like problems for finite sets of words. ICTCS 2014: 81-92 - [c10]Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino:
Universal Lyndon Words. MFCS (1) 2014: 135-146 - [i2]Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino:
Universal Lyndon Words. CoRR abs/1406.5895 (2014) - 2013
- [j37]Arturo Carpi, Flavio D'Alessandro:
Independent sets of words and the synchronization problem. Adv. Appl. Math. 50(3): 339-355 (2013) - 2011
- [j36]Arturo Carpi, Clelia de Felice:
Combinatorics on words. Theor. Comput. Sci. 412(27): 2909-2910 (2011) - [i1]Arturo Carpi, Flavio D'Alessandro:
Independent sets of words and the synchronization problem. CoRR abs/1111.5467 (2011) - 2010
- [j35]Arturo Carpi, Valerio D'Alonzo:
On factors of synchronized sequences. Theor. Comput. Sci. 411(44-46): 3932-3937 (2010) - [c9]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
- [j34]Arturo Carpi, Flavio D'Alessandro:
Strongly transitive automata and the Cerný conjecture. Acta Informatica 46(8): 591-607 (2009) - [j33]Arturo Carpi, Valerio D'Alonzo:
On the Repetitivity Index of Infinite Words. Int. J. Algebra Comput. 19(2): 145-158 (2009) - [j32]Arturo Carpi, Valerio D'Alonzo:
On a word avoiding near repeats. Inf. Process. Lett. 109(13): 679-682 (2009) - [c8]Arturo Carpi, Flavio D'Alessandro:
Synchronizing Automata and Independent Systems of Words. ICTCS 2009: 71-74 - [c7]Arturo Carpi, Flavio D'Alessandro:
The Synchronization Problem for Locally Strongly Transitive Automata. MFCS 2009: 211-222 - 2008
- [c6]Arturo Carpi, Flavio D'Alessandro:
The Synchronization Problem for Strongly Transitive Automata. Developments in Language Theory 2008: 240-251 - 2007
- [j31]Arturo Carpi, Aldo de Luca:
Farey codes and languages. Eur. J. Comb. 28(1): 371-402 (2007) - [j30]Arturo Carpi:
On Dejean's conjecture over large alphabets. Theor. Comput. Sci. 385(1-3): 137-151 (2007) - 2006
- [c5]Arturo Carpi:
On the Repetition Threshold for Large Alphabets. MFCS 2006: 226-237 - 2005
- [j29]Arturo Carpi, Aldo de Luca:
Completions in measure of languages and related combinatorial problems. Theor. Comput. Sci. 330(1): 35-57 (2005) - [j28]Arturo Carpi, Aldo de Luca:
Codes of central Sturmian words. Theor. Comput. Sci. 340(1): 220-239 (2005) - [c4]Arturo Carpi, Aldo de Luca:
Central Sturmian Words: Recent Developments. Developments in Language Theory 2005: 36-56 - 2004
- [j27]Arturo Carpi, Aldo de Luca:
Uniform words. Adv. Appl. Math. 32(3): 485-522 (2004) - [j26]Arturo Carpi, Aldo de Luca:
Harmonic and gold Sturmian words. Eur. J. Comb. 25(5): 685-705 (2004) - [j25]Arturo Carpi, Aldo de Luca:
Repetitions, Fullness, And Uniformity In Two-Dimensional Words. Int. J. Found. Comput. Sci. 15(2): 355-383 (2004) - 2003
- [j24]Arturo Carpi, Aldo de Luca:
Semiperiodic words and root-conjugacy. Theor. Comput. Sci. 292(1): 111-130 (2003) - 2002
- [j23]Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Words, univalent factors, and boxes. Acta Informatica 38(6): 409-436 (2002) - [j22]Arturo Carpi, Aldo de Luca:
A combinatorial property of the factor poset of a word. Inf. Process. Lett. 81(1): 35-39 (2002) - [j21]Arturo Carpi, Aldo de Luca:
On the distribution of characteristic parameters of words. RAIRO Theor. Informatics Appl. 36(1): 67-96 (2002) - [j20]Arturo Carpi, Aldo de Luca:
On the distribution of characteristic parameters of words II. RAIRO Theor. Informatics Appl. 36(1): 97-127 (2002) - 2001
- [j19]Arturo Carpi, Aldo de Luca:
Periodic-like words, periodicity, and boxes. Acta Informatica 37(8): 597-618 (2001) - [j18]Arturo Carpi, Cristiano Maggi:
On synchronized sequences and their separators. RAIRO Theor. Informatics Appl. 35(6): 513-524 (2001) - [j17]Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Special Factors and Uniqueness Conditions in Rational Trees. Theory Comput. Syst. 34(4): 375-395 (2001) - [j16]Arturo Carpi, Aldo de Luca:
Words and special factors. Theor. Comput. Sci. 259(1-2): 145-182 (2001) - 2000
- [j15]Arturo Carpi, Aldo de Luca:
Special Factors, Periodicity, and an Application to Sturmian Words. Acta Informatica 36(12): 983-1006 (2000) - [c3]Arturo Carpi, Aldo de Luca:
Periodic-Like Words. MFCS 2000: 264-274
1990 – 1999
- 1999
- [j14]Arturo Carpi:
On Abelian Squares and Substitutions. Theor. Comput. Sci. 218(1): 61-81 (1999) - [c2]Arturo Carpi, Aldo de Luca:
Repetitions and Boxes in Words and Pictures. Jewels are Forever 1999: 295-306 - [c1]Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Special factors in some combinational structures. Developments in Language Theory 1999: 3-13 - 1998
- [j13]Arturo Carpi:
On the Number of Abelian Square-free Words on Four Letters. Discret. Appl. Math. 81(1-3): 155-167 (1998) - 1994
- [j12]Arturo Carpi:
On Representation Systems. Int. J. Algebra Comput. 4(4): 657- (1994) - [j11]Arturo Carpi:
On Repeated Factors in C^\infty-Words. Inf. Process. Lett. 52(6): 289-294 (1994) - 1993
- [j10]Arturo Carpi:
Repetitions in the Kolakovski sequence. Bull. EATCS 50: 194-197 (1993) - [j9]Arturo Carpi:
On Abelian Power-Free Morphisms. Int. J. Algebra Comput. 3(2): 151-168 (1993) - [j8]Arturo Carpi:
Overlap-Free Words and Finite Automata. Theor. Comput. Sci. 115(2): 243-260 (1993) - 1990
- [j7]Arturo Carpi, Aldo de Luca:
Non-Repetitive Words Relative to a Rewriting System. Theor. Comput. Sci. 72(1): 39-53 (1990)
1980 – 1989
- 1988
- [j6]Arturo Carpi:
Multidimensional Unrepetitive Configurations. Theor. Comput. Sci. 56: 233-241 (1988) - [j5]Arturo Carpi:
On Synchronizing Unambiguous Automata. Theor. Comput. Sci. 60: 285-296 (1988) - 1987
- [j4]Arturo Carpi:
On Unambiguous Reductions of Monoids of Unambiguous Relations. Theor. Comput. Sci. 51: 215-220 (1987) - 1986
- [j3]Arturo Carpi, Aldo de Luca:
Square-Free Words on Partially Commutative Free Monoids. Inf. Process. Lett. 22(3): 125-131 (1986) - 1984
- [j2]Arturo Carpi:
On the Centers of the Set of Weakly Square-Free Words on a Two Letter Alphabet. Inf. Process. Lett. 19(4): 187-190 (1984) - 1983
- [j1]Arturo Carpi:
On the Size of a Square-Free Morphism on a Three Letter Alphabet. Inf. Process. Lett. 16(5): 231-235 (1983)
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-07 22:08 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:
