Recognizability of partial array languages

MaRDI QIDQ3565905zbMATH OpenFDO

Authors F. Sweety, Thiyagarajan Kalyani, Durairaj Gnanaraj Thomas, V. R. Dare

Publication date 7 June 2010

zbMATH Keywords

online tessellation partial automaton (OPTA)partial arrayrecognizability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Partial Commutation on Array Languages
• Combinatorial Image Analysis
• Publication:4939202
• T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
• Infinite Arrays and Domino Systems

Cited in

(3)

• Partial array token Petri net and P system
• Infinite Arrays and Domino Systems
• Partial Commutation on Array Languages

This page was built for publication: Recognizability of partial array languages

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