Approximate language identification

DOI10.1016/S0019-9958(74)91369-2zbMATH Open0309.68063OpenAlexW2101672116MaRDI QIDQ4068110FDOQ4068110

Authors: R. M. Wharton 

Publication date: 1974

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(74)91369-2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• Sequential fuzzy system identification
• Analyzing robustness of Angluin's \(L^*\) algorithm in presence of noise
• Hierarchical resolution of power spectra
• SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
• Complex systems, complexity measures, grammars and model-inferring
• On the effects of noise and speed on computations
• Analyzing robustness of Angluin's \(\mathrm{L}^\ast\) algorithm in presence of noise
• Language learnability in the limit: a generalization of Gold's theorem
• Identification of function distinguishable languages.

This page was built for publication: Approximate language identification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068110)