Login / Signup
Efficient Algorithms for Deciding the Morphism Equivalence Problem for Regular, Linear and Context-Free Languages.
Ismo Hakala
Published in:
J. Inf. Process. Cybern. (1993)
Keyphrases
</>
context free languages
context free
regular languages
grammatical inference
context sensitive
regular expressions
context free grammars
inductive inference
context dependent
finite automata
learning algorithm
relational databases
finite state
semantic representation