On the amount of nonconstructivity in learning formal languages from text
From MaRDI portal
Publication:2051759
DOI10.1016/j.ic.2020.104668OpenAlexW3109219982MaRDI QIDQ2051759
Sanjay Jain, Frank Stephan, Thomas Zeugmann
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.1043
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof systems that take advice
- Computational limits on team identification of languages
- Monotonic and non-monotonic inductive inference
- Turing machines that take advice
- Learning indexed families of recursive languages from positive data: A survey
- Finding patterns common to a set of strings
- Generalization and specialization strategies for learning r. e. languages
- Learning languages and functions by erasing
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Amount of nonconstructivity in deterministic finite automata
- On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data
- On the Amount of Nonconstructivity in Learning Recursive Functions
- Automata that take advice
- Amount of Nonconstructivity in Finite Automata
- Inductive inference of formal languages from positive data
- The Power of Pluralism for Automatic Program Synthesis
- Periodicity in generations of automata
- Consequences of the provability of NP ⊆ P/poly
- Language identification in the limit
- Some remarks on the theory of graphs
