Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

87

WIA
2007
Springer

87views Artificial Intelligence» more WIA 2007»

Finite State Automata Representing Two-Dimensional Subshifts

15 years 9 months ago

Finite State Automata Representing Two-Dimensional Subshifts

Download www.stringology.org

Natasa Jonoska, Joni Burnette Pirnot

Real-time Traffic

Artificial Intelligence | WIA 2007 |

claim paper

Related Content

» Ultimate Traces of Cellular Automata

» Optimal Metric Planning with State Sets in Automata Representation

» On Succinct Representations of Textured Surfaces by Weighted Finite Automata

» PACLearnability of Probabilistic Deterministic Finite State Automata in Terms of Variation...

» Pattern Classification In Symbolic Streams via Semantic Annihilation of Information

» Positive Grammar Checking A Finite State Approach

» On the Many Faces of Block Codes

» Symbolic Model Checking of Finite Precision Timed Automata

» Learning Finite Automata Using Local Distinguishing Experiments

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WIA
Authors	Natasa Jonoska, Joni Burnette Pirnot

Comments (0)