495 search results - page 43 / 99 » Automata and differentiable words |
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
COLT
1995
Springer
13 years 11 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
TCS
2008
13 years 7 months ago
2008
Reversible computing is a paradigm where computing models are so defined that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. ...
IANDC
2008
13 years 7 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract. Differential repetitive processes are a distinct class of continuous-discrete twodimensional linear systems of both systems theoretic and applications interest. These pr...