A variant of random context grammars: semi-conditional grammars
Theoretical Computer Science
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning approximately regular languages with reversible languages
Theoretical Computer Science
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Inference of Reversible Languages
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Permutations and Control Sets for Learning Non-regular Language Families
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Algorithms for Learning Function Distinguishable Regular Languages
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Current Trends in Grammatical Inference
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Conditional Context-Free Languages of Finite Index
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Learning Formal Languages Based on Control Sets
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Identification of Function Distinguishable Languages
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Effiscient learning of some linear matrix languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
We introduce the concept of fragmentation in order to adapt the learnability of regular languages towards other regular and nonregular language families. More precisely, rational transducers can be used to implement explicit fragmentation to define new identifiable regular language classes. Context conditions can be used to construe identifiable and characterizable language classes which may contain nonregular languages by means of implicit fragmentation.