LATA 2009 - PDF Preprint Papers

LATA 2009 Language and Automata Theory and Applications

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LATA-2009 Paper

click to vote

LATA
2009
Springer

170views Artificial Intelligence» more LATA 2009»

A Cryptosystem Based on the Composition of Reversible Cellular Automata

13 years 11 months ago

Download research.cs.queensu.ca

We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain te...

Adam Clarridge, Kai Salomaa

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	170	A Cryptosystem Based on the Composition of Reversible Cellular Automata	claim
2	136	Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications	claim
3	127	Absolute Convergence of Rational Series Is Semi-decidable	claim
4	126	Bounded Hairpin Completion	claim
5	123	Tiling the Plane with a Fixed Number of Polyominoes	claim
6	120	Recent Developments in Algorithmic Teaching	claim
7	120	Converting Self-verifying Automata into Deterministic Automata	claim
8	117	An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms	claim
9	116	Termination of Priority Rewriting	claim
10	115	Rigid Tree Automata	claim
11	114	Learning by Erasing in Dynamic Epistemic Logic	claim
12	112	Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata	claim
13	112	Counting Parameterized Border Arrays for a Binary Alphabet	claim
14	111	A Kleene Theorem for Forest Languages	claim
15	109	Automata on Gauss Words	claim
16	108	Nested Counters in Bit-Parallel String Matching	claim
17	107	Decision Problems for Convex Languages	claim
18	104	On the Average Size of Glushkov's Automata	claim
19	102	Nondeterministic Instance Complexity and Proof Systems with Advice	claim
20	101	A Series of Run-Rich Strings	claim
21	97	Hypothesis Spaces for Learning	claim
22	90	Bounded Delay and Concurrency for Earliest Query Answering	claim
23	87	The Fault Tolerance of NP-Hard Problems	claim
24	86	Prediction of Creole Emergence in Spatial Language Dynamics	claim
25	85	Two Equivalent Regularizations for Tree Adjoining Grammars	claim
26	85	Matching Trace Patterns with Regular Policies	claim
27	84	On Extended Regular Expressions	claim
28	82	Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions	claim
29	81	From Gene Trees to Species Trees through a Supertree Approach	claim
30	76	Segmentation Charts for Czech - Relations among Segments in Complex Sentences	claim
31	75	On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata	claim
32	73	On a Family of Morphic Images of Arnoux-Rauzy Words	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers