184 search results - page 4 / 37 » A New Algorithm of Constructing the Basis Finite Automaton |
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
CONCUR
2006
Springer
14 years 11 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...
CSR
2006
Springer
15 years 1 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
STOC
1991
ACM
15 years 1 months ago
1991
ACM
We describe a new deterministic algorithm for the problem of constructing k-th