Learning pattern languages over groups
From MaRDI portal
Publication:1663643
DOI10.1016/j.tcs.2017.12.031zbMath1398.68265OpenAlexW3125882234MaRDI QIDQ1663643
Sanjay Jain, Frank Stephan, Rupert Hölzl
Publication date: 22 August 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.031
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 (1)
Cites Work
- 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
- Learnability of automatic classes
- Incremental learning from positive data
- The synthesis of language learners.
- On rationality of verbal subsets in a group
- Automatic learners with feedback queries
- Learning Pattern Languages over Groups
- Automatic functions, linear time and learning
- The Complexity of Verbal Languages over Groups
- Three Lectures on Automatic Structures
- Learning Relational Patterns
- 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
- Toward a mathematical theory of inductive inference
- Criteria of language learning
- DEFINABLE SETS IN A HYPERBOLIC GROUP
- ON AUTOMATIC FAMILIES
- Semiautomatic Structures
- Language identification in the limit
- STACS 2005
- Abstract Algebra
- Inductive inference of unbounded unions of pattern languages from positive data
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Learning pattern languages over groups
