The efficiency of identifying timed automata and the power of clocks (Q553334): Difference between revisions

@@ Property / cites work @@
+A theory of timed automata
@@ Property / cites work: A theory of timed automata / rank @@
+Normal rank
@@ Property / cites work @@
+Uppaal in a nutshell
@@ Property / cites work: Uppaal in a nutshell / rank @@
+Normal rank
@@ Property / cites work @@
+Q3392273
@@ Property / cites work: Q3392273 / rank @@
+Normal rank
@@ Property / cites work @@
+Event-clock automata: a determinizable class of timed automata
+Normal rank
@@ Property / cites work @@
+Inference of Event-Recording Automata Using Timed Decision Trees
+Normal rank
@@ Property / cites work @@
+Complexity of automaton identification from given data
+Normal rank
@@ Property / cites work @@
+Language identification in the limit
@@ Property / cites work: Language identification in the limit / rank @@
+Normal rank
@@ Property / cites work @@
+Characteristic sets for polynomial grammatical inference
+Normal rank
@@ Property / cites work @@
+On polynomial-time learnability in the limit of strictly deterministic automata
+Normal rank
@@ Property / cites work @@
+CONCUR 2004 - Concurrency Theory
@@ Property / cites work: CONCUR 2004 - Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Timed regular expressions
@@ Property / cites work: Timed regular expressions / rank @@
+Normal rank
@@ Property / cites work @@
+Teaching a smarter learner.
@@ Property / cites work: Teaching a smarter learner. / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal NFA Problems are Hard
@@ Property / cites work: Minimal NFA Problems are Hard / rank @@
+Normal rank