An algorithm computes the bandwidth of normal timed automata by reducing the problem to finding the maximum reward-to-cost ratio in a weighted finite graph built from the automaton.
Miller , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.FL 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Asymptotic Hausdorff lifting defines asymptotic similarity metrics on languages under normalized edit distances and characterizes the induced equivalence classes on regular languages.
citing papers explorer
-
Weighing Timed Regular Languages: The Final Step (long version)
An algorithm computes the bandwidth of normal timed automata by reducing the problem to finding the maximum reward-to-cost ratio in a weighted finite graph built from the automaton.
-
Asymptotic Hausdorff and Language Similarity
Asymptotic Hausdorff lifting defines asymptotic similarity metrics on languages under normalized edit distances and characterizes the induced equivalence classes on regular languages.