MFCS 2007 - PDF Preprint Papers

MFCS 2007 International Symposium on Mathematical Foundations of Computer

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed MFCS-2007 Paper

click to vote

MFCS
2007
Springer

160views Theoretical Computer Science» more MFCS 2007»

Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods

13 years 10 months ago

Download www.lif.univ-mrs.fr

In this paper we study language recognition by two-dimensional cellular automata on diﬀerent possible neighborhoods. Since it is known that all complete neighborhoods are linearl...

Martin Delacourt, Victor Poupet

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	160	Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods	claim
2	139	NP by Means of Lifts and Shadows	claim
3	121	Hardness Results for Tournament Isomorphism and Automorphism	claim
4	121	Evolvability	claim
5	116	Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach	claim
6	111	On Approximation of Bookmark Assignments	claim
7	110	Transition Graphs of Rewriting Systems over Unranked Trees	claim
8	109	On the Complexity of Computing Treelength	claim
9	107	Exact Algorithms for L (2, 1)-Labeling of Graphs	claim
10	104	Towards a Rice Theorem on Traces of Cellular Automata	claim
11	103	Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete	claim
12	99	Minimum Cycle Bases in Graphs Algorithms and Applications	claim
13	99	Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority	claim
14	96	Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs	claim
15	94	Structural Analysis of Gapped Motifs of a String	claim
16	94	Selfish Load Balancing Under Partial Knowledge	claim
17	92	Reachability Problems in Quaternion Matrix and Rotation Semigroups	claim
18	92	Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances	claim
19	92	Traces of Term-Automatic Graphs	claim
20	89	The Maximum Solution Problem on Graphs	claim
21	88	Semisimple Algebras of Almost Minimal Rank over the Reals	claim
22	85	The Power of Two Prices: Beyond Cross-Monotonicity	claim
23	85	Dynamic Matchings in Convex Bipartite Graphs	claim
24	85	Nearly Private Information Retrieval	claim
25	85	Expander Properties and the Cover Time of Random Intersection Graphs	claim
26	82	On Time Lookahead Algorithms for the Online Data Acknowledgement Problem	claim
27	80	Properties Complementary to Program Self-reference	claim
28	80	Height-Deterministic Pushdown Automata	claim
29	79	Minimizing Variants of Visibly Pushdown Automata	claim
30	77	Finding Patterns in Given Intervals	claim
31	74	Small Alliances in Graphs	claim
32	71	Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults	claim
33	70	What Are Iteration Theories?	claim
34	68	Communication in Networks with Random Dependent Faults	claim
35	58	Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers