41 search results - page 6 / 9 » A Parallel Algorithm for Minimization of Finite Automata |
143
click to vote
FPL
1999
Springer
15 years 9 months ago
1999
Springer
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
175
Voted
ACSD
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
141
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
136
click to vote
CONCUR
2009
Springer
15 years 11 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
148
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de...