scientific article; zbMATH DE number 1512708

zbMATH Open0962.68118MaRDI QIDQ4508397FDOQ4508397

Authors: Thomas Worsch 

Publication date: 24 June 2001

Title of this publication is not available (Why is that?)

Recommendations

• On one-way one-bit \(O\) (one)-message cellular automata
• Fast parallel language recognition by cellular automata
• scientific article; zbMATH DE number 3872685
• scientific article; zbMATH DE number 1834667
• Language classes defined by time-bounded relativised cellular automata

zbMATH Keywords

OCAcellular automata with restricted communication

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Cited In (15)

• Sublinear-time language recognition and decision by one-dimensional cellular automata
• Title not available (Why is that?)
• Cellular Automata with Sparse Communication
• Cellular automata with limited inter-cell bandwidth
• Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton
• Hierarchies and undecidability results for iterative arrays with sparse communication
• On two-way communication in cellular automata with a fixed number of cells
• Hierarchies and undecidability results for iterative arrays with sparse communication
• Cellular automata with sparse communication
• TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES
• Iterative arrays with finite inter-cell communication
• Title not available (Why is that?)
• Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
• On one-way one-bit \(O\) (one)-message cellular automata
• Iterative arrays with finite inter-cell communication

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508397)