Login / Signup
An Explicit Formula for the Intersection of Two Polynomials of Regular Languages.
Jean-Éric Pin
Published in:
Developments in Language Theory (2013)
Keyphrases
</>
regular languages
context free languages
grammatical inference
regular expressions
finite automata
decision problems
context free grammars
context free
positive data
inductive inference
pac learning
computational complexity
pattern matching
context dependent
database