Learning Pattern Languages over Groups

DOI10.1007/978-3-319-46379-7_13zbMath1398.68264OpenAlexW2521573183MaRDI QIDQ2830276

Rupert Hölzl, Sanjay Jain, Frank Stephan

Publication date: 9 November 2016

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-46379-7_13

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

Learning pattern languages over groups ⋮ Semiautomatic structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Polynomial-time inference of arbitrary pattern languages
• A non-learnable class of E-pattern languages
• Elementary theory of free non-abelian groups.
• FA-presentable groups and rings
• Finding patterns common to a set of strings
• Incremental learning from positive data
• The synthesis of language learners.
• On rationality of verbal subsets in a group
• Automatic learners with feedback queries
• Three Lectures on Automatic Structures
• The additive group of the rationals does not have an automatic presentation
• Automata Presenting Structures: A Survey of the Finite String Case
• Describing Groups
• Inductive inference of formal languages from positive data
• Criteria of language learning
• DEFINABLE SETS IN A HYPERBOLIC GROUP
• ON AUTOMATIC FAMILIES
• Language identification in the limit
• STACS 2005
• Inductive inference of unbounded unions of pattern languages from positive data

This page was built for publication: Learning Pattern Languages over Groups