Learning of erasing primitive formal systems from positive examples
From MaRDI portal
Publication:860828
DOI10.1016/j.tcs.2006.07.043zbMath1110.68057MaRDI QIDQ860828
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.043
inductive inference; elementary formal system; erasing pattern language; positive example; primitive formal system
68Q32: Computational learning theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards a mathematical theory of machine discovery from facts
- Inductive inference of monotonic formal systems from positive data
- Learning elementary formal systems
- Rich classes inferable from positive data: Length-bounded elementary formal systems
- Inductive inference of formal languages from positive data
- Learning Theory
- Algorithmic Learning Theory
- Monadic Elementary Formal Systems
- Language identification in the limit