50 search results - page 2 / 10 » Decidability and Complexity in Automatic Monoids |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
FOSSACS
2001
Springer
13 years 9 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
JSYML
2010
13 years 3 days ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Automated negotiation techniques have received considerable attention over the past decade, and much progress has been made in developing negotiation protocols and strate...
ISMIR
2004
Springer
13 years 10 months ago
2004
Springer
Several factors affecting the automatic classification of musical audio signals are examined. Classification is performed on short audio frames and results are reported as “ba...