59 search results - page 11 / 12 » Profinite Methods in Automata Theory |
LATA
2009
Springer
14 years 22 days ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
RTSS
2008
IEEE
14 years 10 days ago
2008
IEEE
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
LICS
2000
IEEE
13 years 10 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
ATAL
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents the dynamics of multi-agent reinforcement learning in multiple state problems. We extend previous work that formally modelled the relation between reinforcemen...
MLG
2007
Springer
14 years 3 days ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...