Polynomial Time Algorithm for Inferring Subclasses of Parallel Internal Column Contextual Array Languages

DOI10.1007/978-3-319-59108-7_13zbMath1486.68089OpenAlexW2614593897MaRDI QIDQ5077673

Saleem Malik, Alok Kumar Pani, Abhisek Midya, Shaleen Bhatnagar, D. Gnanaraj Thomas

Publication date: 18 May 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59108-7_13

zbMATH Keywords

identification in the limit from positive dataparallel internal column contextual array grammars

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages

This page was built for publication: Polynomial Time Algorithm for Inferring Subclasses of Parallel Internal Column Contextual Array Languages