Login / Signup
A logical characterization of timed regular languages.
Marcello M. Bersani
Matteo Rossi
Pierluigi San Pietro
Published in:
Theor. Comput. Sci. (2017)
Keyphrases
</>
regular languages
context free languages
regular expressions
grammatical inference
finite state machines
finite automata
decision problems
positive data
pac learning
context free grammars
context free
pattern matching
machine learning
objective function
database
decision trees
metadata