1728 search results - page 42 / 346 » The Size of Power Automata |
AUSAI
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents two novel features of an emergent data visualization method coined "cellular ants": unsupervised data class labeling and shape negotiation. This metho...
DLT
2010
15 years 1 months ago
2010
The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...
117
click to vote
IC
2004
15 years 1 months ago
2004
This paper describes a validating XML parsing method based on deterministic finite state automata (DFA). XML parsing and validation is performed by a schema-specific XML parser th...
SPIN
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
104
click to vote
IJFCS
2006
14 years 12 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...