Polynomial time algorithm for inferring subclasses of parallel internal column contextual array languages

DOI10.1007/978-3-319-59108-7_13MaRDI QIDQ5077673zbMATH OpenOpenAlexFDO

Authors Abhisek Midya, Alok Kumar Pani, Saleem Malik, Shaleen Bhatnagar, Durairaj 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

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

Recommendations

• scientific article; zbMATH DE number 1670713
• Polynomial time learner for inferring subclasses of internal contextual grammars with local maximum selectors
• A Polynomial Algorithm for the Inference of Context Free Languages
• Learning Subclasses of Parallel Communicating Grammar Systems
• Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time

Cited in

(2)

• scientific article; zbMATH DE number 1670713 (Why is no real title available?)
• 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

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