Filters








2,733 Hits in 7.6 sec

Learning a subclass of regular patterns in polynomial time

John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
2006 Theoretical Computer Science  
An algorithm for learning a subclass of erasing regular pattern languages is presented.  ...  arbitrarily high probability of success using a number of examples polynomial in m (and exponential in c).  ...  These descriptive patterns are computable in time polynomial in the length of all examples seen so far.  ... 
doi:10.1016/j.tcs.2006.07.044 fatcat:6pr5h46eenbj5ckn7k5vo6si6a

Learning a Subclass of Regular Patterns in Polynomial Time [chapter]

John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
2003 Lecture Notes in Computer Science  
An algorithm for learning a subclass of erasing regular pattern languages is presented.  ...  it runs with arbitrarily high probability of success using a number of examples polynomial in m (and exponential in c ).  ...  These descriptive patterns are computable in time polynomial in the length of all examples seen so far.  ... 
doi:10.1007/978-3-540-39624-6_19 fatcat:nwz2sqhkebeo5mufvzqtsz7myu

Page 1400 of Mathematical Reviews Vol. , Issue 2004b [page]

2004 Mathematical Reviews  
The bounded unions of regular pattern languages are polynomial- time predictable with membership queries.  ...  Furthermore, the learnability of the class of unions of regular pattern languages, which is a subclass of HEFSs, is investigated.  ... 

On the Learnability of Erasing Pattern Languages in the Query Model [chapter]

Steffen Lange, Sandra Zilles
2003 Lecture Notes in Computer Science  
It provides new results concerning the principal learning capabilities of query learners as well as the power and limitations of polynomial-time query learners.  ...  The present paper deals with the problem of learning the erasing pattern languages and natural subclasses thereof within Angluin's model of learning with queries.  ...  Theorem 13 . 13 (i) Polynomially many queries suffice to learn the class of all regular erasing pattern languages with restricted superset queries.  ... 
doi:10.1007/978-3-540-39624-6_12 fatcat:v3zkp3yo2bgkrfhnno6bjkt4ju

Learning elementary formal systems with queries

Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura
2003 Theoretical Computer Science  
Furthermore, the learnability of the class of unions of regular pattern languages, which is a subclass of HEFSs, is investigated.  ...  The bounded unions of regular pattern languages are polynomial-time predictable with membership query.  ...  The second author also would like to thank Noriko Sugimoto, Shinichi Shimozono and Takashi Toyoshima for the fruitful discussions on this issue in the joint work [41] , which partially gives a motivation  ... 
doi:10.1016/s0304-3975(02)00417-6 fatcat:rse677b3pzcspm7bwtk2yeflhe

Foreword

Takeshi Shinohara, Carl H. Smith, Thomas Zeugmann
2003 Theoretical Computer Science  
Arikawa has had a long and distinguished career. He has personally made signiÿcant contributions in the areas of pattern matching, B-tree's, model inference, formal systems and inductive inference.  ...  All of these topics relate in some way to his life long commitment to understanding and automating the learning process. During this time he supervised more than 20 doctoral students.  ...  Regular pattern languages are a subclass of Angluin's pattern languages (every variable is allowed to occur at most once) and consist themselves a subclass of all regular languages.  ... 
doi:10.1016/s0304-3975(02)00415-2 fatcat:gn4tdrvr3jembeqnyyeq5mhazi

Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data [chapter]

Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki
1994 Lecture Notes in Computer Science  
In this paper we are concerning with polynomial time inference from positive data of the class of unions of a bounded number of pattern languages.  ...  As results several classes of unions of pattern languages are shown to be polynomial time inferable from positive data.  ...  In this paper, we consider several subclasses of unions of pattern languages for which an ecient learning algorithm exists.  ... 
doi:10.1007/3-540-57785-8_178 fatcat:nqbeqsqs5fap7ndi6ref4jnocu

Decision lists over regular patterns

Steffen Lange, Jochen Nessel
2003 Theoretical Computer Science  
Formal properties of the resulting language class, a subclass of the regular languages, are investigated.  ...  The paper introduces the notion of decision lists over regular patterns. This formalism provides a strict extension of regular erasing pattern languages and of containment decision lists.  ...  A language class L is polynomial-time PAC learnable if there exists a learning algorithm A such that (1) A takes a sequence of examples as input and runs in polynomial time with respect to the length of  ... 
doi:10.1016/s0304-3975(02)00419-x fatcat:nncb46j3q5fwtpj54iyy2qniwq

Grammatical Inference and Language Frameworks for LANGSEC

Dr. Kerry N. Wood, Dr. Richard E. Harang
2015 2015 IEEE Security and Privacy Workshops  
Given a string, can it be efficiently (polynomial time) determined if the string is a member of the target language?  ...  Finally, we present initial results of pattern language learning on logged HTTP sessions and suggest future areas of research.  ...  Every regular pattern corresponds to a regular language 1 , and finite regular languages can be parsed in polynomial time by a finite state automaton (FSA). B.  ... 
doi:10.1109/spw.2015.17 dblp:conf/sp/WoodH15 fatcat:paiqhvsx6vcifc7f6vzkurbbl4

Learning Subclasses of Parallel Communicating Grammar Systems [chapter]

Sindhu J. Kumaar, P. J. Abisha, D. G. Thomas
2010 Lecture Notes in Computer Science  
Pattern language learning algorithms within the inductive inference model and query learning setting have been of great interest.  ...  The algorithm to learn PPL takes time which is polynomial in the length of the pattern and maximum length of an axiom.  ...  L* runs in time which is polynomial in the number of states of the automaton and the length of the longest counter example. Therefore time taken by the algorithm to learn PCPPL is also polynomial.  ... 
doi:10.1007/978-3-642-15488-1_31 fatcat:cxgmdmep2rcw5hotflf4n7ffd4

Protein Motif Discovery from Positive Examples by Minimal Multiple Generalization over Regular Patterns

Hiroki Arimura, Ryoichi Fujino, Takeshi Shinohara, Setsuo Arikawa
1994 Genome Informatics Series  
Let D be a subclass of regular patterns.  ...  regular pattern languages in D is polynomial time inferable from positive data. 3 Learning  ... 
doi:10.11234/gi1990.5.39 fatcat:bkz4kbqiw5a3jgukpeiwbdmwnu

Formal and Empirical Grammatical Inference

Jeffrey Heinz, Colin de la Higuera, Menno van Zaanen
2011 Annual Meeting of the Association for Computational Linguistics  
There have been new strong positive results in a recent past for all the cases mentioned (subclasses of regular, PFA, transducers, CFGs, MCSGs)  ...  Formal GI and learning theory GI of Regular Patterns Empirical GI and nonregular patterns Polynomial queries (Angluin 1987) Algorithm A learns with a polynomial number of queries if the number of queries  ...  Definition: polynomial characteristic sample We can try to bound G has polynomial characteristic samples for identification learner A global time if there exists a polynomial p() such that: given any G  ... 
dblp:conf/acl/HeinzHZ11 fatcat:na7nuc7oifg4rcgjjflnzuxqju

Learning of Elementary Formal Systems with Two Clauses Using Queries

Hirotaka KATO, Satoshi MATSUMOTO, Tetsuhiro MIYAHARA
2009 IEICE transactions on information and systems  
The class rEFS contains the class of regular patterns, which is extensively studied in Learning Theory. Let Γ * be a target EFS in rEFS of learning.  ...  Moreover, for other types of queries, we show that there exists no polynomial time learning algorithm for rEFS by using the queries.  ...  In this paper, we give a polynomial time learning algorithm for a subclass of EFSs in the exact learning model.  ... 
doi:10.1587/transinf.e92.d.172 fatcat:efvftkmxzfdd5gptfhp23oxmla

Page 3353 of Mathematical Reviews Vol. , Issue 2001E [page]

2001 Mathematical Reviews  
A proper pattern contains at least one variable. A regular pattern contains at most one occurrence of every vari- able.  ...  Further, we show a negative result: that there are no polynomial- time algorithms capable of learning width-3 OBDDs from proper equivalence queries alone.” 2001¢:68090 68Q32 68T0S Shinohara, Takeshi (J-K  ... 

A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains

S. Arikawa, S. Kuhara, S. Miyano, A. Shinohara, T. Shinohara
1992 Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences  
Tlle algorithm in [lo] runs of predicate symbols. We assume that C , X , and 11 in polynomial time for some subclasses of EFSs. But, are mutually disjoint.  ...  Second, EFSs include patterns or regular expressions as special instances and have In [lo] we have shown that some subclasses of elinucll expressive ability.  ... 
doi:10.1109/hicss.1992.183220 fatcat:bzbyuys465gerpogsgowqmnugu
« Previous Showing results 1 — 15 out of 2,733 results