Infinite Arrays and Domino Systems

DOI10.1016/S1571-0653(04)00498-6MaRDI QIDQ3438930zbMATH OpenOpenAlexFDO

Authors S. Gnanasekaran, V. R. Dare

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0653(04)00498-6

zbMATH Keywords

algorithmfinite arrayinfinite arraylearninglocal arrayonline tesselation automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonnumerical algorithms (68W05)

Recommendations

• Combinatorial Image Analysis
• Infinite arrays and controlled deterministic table 0L array systems
• Recognizability of partial array languages
• scientific article; zbMATH DE number 3845078
• Iso-array Acceptors and Learning

Cites work

• Combinatorial Image Analysis
• scientific article; zbMATH DE number 3982543 (Why is no real title available?)
• Language identification in the limit
• Local languages and the Berry-Sethi algorithm
• Recognizable picture languages and domino tiling

Cited in

(4)

• scientific article; zbMATH DE number 3845078 (Why is no real title available?)
• Recognizability of partial array languages
• Combinatorial Image Analysis
• Infinite arrays and controlled deterministic table 0L array systems

This page was built for publication: Infinite Arrays and Domino Systems

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