1. Home
  2. Material Detail: Polynomial distinguishability of timed automata

Material Detail

Polynomial distinguishability of timed automata

Polynomial distinguishability of timed automata

This video was recorded at 9th International Colloquium on Grammatical Inference (ICGI), Saint-Malo 2008. ICGI-2008 is the ninth in a series of successful biennial international conferences in the area of grammatical inference. Grammatical inference has been extensively addressed by researchers in information theory, automata theory, language acquisition, computational linguistics, machine learning, pattern recognition, computational learning theory and neural networks.
Keywords:
videolectures, ocwc, oec
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Presentation
Date Added to MERLOT:
February 8, 2015
Date Modified in MERLOT:
February 8, 2015
Author:
Submitter:
The Open Education Consortium
Primary Audience:
College General Ed, College Lower Division, College Upper Division
Technical Format:
Video
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
No
Accessibility Information Available:
Unknown
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States

Browse...

Disciplines with similar materials as Polynomial distinguishability of timed automata
People who viewed this also viewed
Other materials like Polynomial distinguishability of timed automata

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.