Recognition and learning of a class of context-sensitive languages described by augmented regular expressions
Authors:
- René AlquézarRARené Alquézar
- Alberto SanfeliuASAlberto Sanfeliu
- 1 January 1997
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 30 (1) , 163-182
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An Algebraic Framework to Represent Finite State Machines in Single-Layer Recurrent Neural NetworksNeural Computation, 1995
- Theoretical aspects of syntactic pattern recognitionPattern Recognition, 1995
- Learning and Extracting Finite State Automata with Second-Order Recurrent Neural NetworksNeural Computation, 1992
- Inference of even linear grammars and its application to picture description languagesPattern Recognition, 1988
- Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationshipsPattern Recognition, 1988
- Grammatical inference for even linear languages based on control setsInformation Processing Letters, 1988
- Inductive Inference: Theory and MethodsACM Computing Surveys, 1983
- Complexity of automaton identification from given dataInformation and Control, 1978
- Transition network grammars for natural language analysisCommunications of the ACM, 1970
- Language identification in the limitInformation and Control, 1967