Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
From MaRDI portal
Publication:3618571
DOI10.1007/978-3-642-00982-2_8zbMath1234.68190OpenAlexW64362254MaRDI QIDQ3618571
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_8
Related Items
Cites Work
- A non-learnable class of E-pattern languages
- Inductive inference of formal languages from positive data
- Learning Integer Lattices
- Algebraic Theory of Automata and Languages
- Language identification in the limit
- Learning algebraic structures from text
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item