Amanote Research

Amanote Research

    RegisterSign In

Characteristic Sets for Learning K-Acceptable Languages

ECTI Transactions on Computer and Information Technology - Thailand
doi 10.37936/ecti-cit.201151.54230
Full Text
Open PDF
Abstract

Available in full text

Categories
Electronic EngineeringInformation SystemsComputer NetworksCommunicationsManagementElectrical
Date

January 1, 1970

Authors
Anuchit JitpattanakulAthasit Surarerks
Publisher

ECTI


Related search

Learning (K,l)-Contextual Tree Languages for Information Extraction From Web Pages

Machine Learning
Artificial IntelligenceSoftware
2008English

Semantic Representations and Query Languages for Or-Sets

1993English

Algebraic Sets With Fully Characteristic Radicals

Journal of Siberian Federal University - Mathematics and Physics
MathematicsAstronomyPhysics
2017English

Algorithmic Construction of Sets for K-Restrictions

ACM Transactions on Algorithms
Mathematics
2006English

Bicovariograms and Euler Characteristic of Regular Sets

Mathematische Nachrichten
Mathematics
2017English

Learning More Foreign Languages

2017English

Identifying Cognate Sets Across Dictionaries of Related Languages

2017English

$K$-Partitions and a Characterization for Compact Unions of $K$ Starshaped Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Lemmatization for Variation-Rich Languages Using Deep Learning

Digital Scholarship in the Humanities
LinguisticsComputer Science ApplicationsInformation SystemsLanguage
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy