Generalized regular expressions — A language for synthesis of programs with branching in loops
Theoretical Computer Science
Learning from good and bad data
Learning from good and bad data
Prudence and other conditions on formal language learning
Information and Computation
Types of monotonic language learning and their characterization
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Efficient identification of regular expressions from representative examples
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Learning a subclass of regular expressions by recognizing periodic repetitions
SCAI93 Proceedings of the Fourth Scandinavian Conference on Artificial intelligence---93
Incremental learning from positive data
Journal of Computer and System Sciences
Efficient learning of regular expressions from approximate examples
Computational learning theory and natural learning systems: Volume IV
One-unambiguous regular languages
Information and Computation
Deterministic generalized automata
Theoretical Computer Science
Inference of Reversible Languages
Journal of the ACM (JACM)
On a class of regular-like expressions for linear languages
Journal of Automata, Languages and Combinatorics
SWYN: a visual representation for regular expressions
Your wish is my command
Handbook of Formal Languages
XTRACT: Learning Document Type Descriptors from XML Document Collections
Data Mining and Knowledge Discovery
Permutations and Control Sets for Learning Non-regular Language Families
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Forming Grammars for Structured Documents: an Application of Grammatical Inference
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Mining for Putative Regulatory Elements in the Yeast Genome Using Gene Expression Data
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Disambiguation of SGML Content Models
PODP '96 Proceedings of the Third International Workshop on Principles of Document Processing
A Guided Tour Across the Boundaries of Learning Recursive Languages
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Learning of regular expressions by pattern matching
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
Learning A Class of Regular Expressions via Restricted Subset Queries
AII '92 Proceedings of the International Workshop on Analogical and Inductive Inference
Unambiguity of Extended Regular Expressions in SGML Document Grammars
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Inductive Synthesis of Dot Expressions
Baltic Computer Science, Selected Papers
Identification of function distinguishable languages
Theoretical Computer Science
Efficient preprocessing of XML queries using structured signatures
Information Processing Letters
Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Beginning Regular Expressions
On algebraic expressions of series-parallel and Fibonacci graphs
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Algorithms for learning regular expressions
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Context-Free grammars and XML languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Inference of concise regular expressions and DTDs
ACM Transactions on Database Systems (TODS)
Learning regular expressions from representative examples and membership queries
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Enabling information extraction by inference of regular expressions from sample entities
Proceedings of the 20th ACM international conference on Information and knowledge management
Improving recall of regular expressions for information extraction
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Fast learning of restricted regular expressions and DTDs
Proceedings of the 16th International Conference on Database Theory
Learning regular expressions to template-based FAQ retrieval systems
Knowledge-Based Systems
| Hi-index | 0.00 |
We describe algorithms that directly infer very simple forms of 1-unambiguous regular expressions from positive data. Thus, we characterize the regular language classes that can be learned this way, both in terms of regular expressions and in terms of (not necessarily minimal) deterministic finite automata.