TCS 2011 - PDF Preprint Papers

TCS 2011 International Conference on Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCS-2011 Paper

click to vote

TCS
2011

264views Theoretical Computer Science» more TCS 2011»

Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern

13 years 7 months ago

Download www.dsi.unifi.it

We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...

Donatella Merlini, Renzo Sprugnoli

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	264	Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern	claim
2	223	Smart PAC-learners	claim
3	221	Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs	claim
4	220	Minimal non-convex words	claim
5	211	Bounds for the generalized repetition threshold	claim
6	210	Dynamic normal forms and dynamic characteristic polynomial	claim
7	200	On the relationship between fuzzy and Boolean cellular automata	claim
8	196	The transposition median problem is NP-complete	claim
9	196	An algorithmic framework for network reconstruction	claim
10	183	Communication complexity and intrinsic universality in cellular automata	claim
11	180	Computational processes, observers and Turing incompleteness	claim
12	180	Complexity of the traveling tournament problem	claim
13	179	Bitonic sorters of minimal depth	claim
14	178	Correctness of linear logic proof structures is NL-complete	claim
15	170	Predicting the labels of an unknown graph via adaptive exploration	claim
16	170	Parameter estimation for Boolean models of biological networks	claim
17	166	Limitations of self-assembly at temperature 1	claim
18	166	A semantic measure of the execution time in linear logic	claim
19	164	Computing monodromy via continuation methods on random Riemann surfaces	claim
20	163	Realizability models and implicit complexity	claim
21	163	Aspects of predicative algebraic set theory, II: Realizability	claim
22	163	Optimization techniques for small matrix multiplication	claim
23	162	Intuitionistic differential nets and lambda-calculus	claim
24	160	A linear algorithm for MLL proof net correctness and sequentialization	claim
25	158	Combinatorics on words	claim
26	157	Last cases of Dejean's conjecture	claim
27	155	Musings around the geometry of interaction, and coherence	claim
28	155	Quasi-interpretations a way to control resources	claim
29	152	Block insertion and deletion on trajectories	claim
30	151	Optimizing n-variate (n+k)-nomials for small k	claim
31	150	Local and global price of anarchy of graphical games	claim
32	150	Strong normalization from an unusual point of view	claim
33	149	Four states are enough!	claim
34	149	Two faces of active learning	claim
35	149	Sorting and selection on dynamic data	claim
36	143	Highly concurrent multi-word synchronization	claim
37	143	Computational ludics	claim
38	139	P systems with minimal insertion and deletion	claim
39	139	Pricing commodities	claim
40	134	On the complex behavior of simple tag systems - An experimental approach	claim
41	132	Local 7-coloring for planar subgraphs of unit disk graphs	claim
42	131	The three column Bandpass problem is solvable in linear time	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers