Hi, I am looking for technical papers and/or code for a simple form of linguistic pattern recognition, specifically, that for finite automata.
Its well known that a "regular language" (a type of formal language) is in 1-1 correpsondance with a finite state machine (each finie state machine can recognize a regular language, & etc.) This is covered in standard intro to computing textbooks. Soo .. given a collection of samples from a language I know to be regular, I'd like to find a (more or less minimal) automaton that recognizes/generates this language. For my purposes, I don't much care if the algo is a bit "fuzzy", i.e. matches most but not all of the set of strings. At first, I thought this was easy enough that I could just dash off a program that did this, without thinking about it, but now realize the problem is harder than that. Where's the academic theory for something like this? Regular languages are left-recursive; what about stack languages (context-free), or more general context-sensitive langs (which require turning machines)? --linas ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?member_id=231415&user_secret=e9e40a7e
