223 search results - page 32 / 45 » Construction of Tree Automata from Regular Expressions |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
ENTCS
2006
13 years 7 months ago
2006
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic comp...
ITICSE
2004
ACM
14 years 29 days ago
2004
ACM
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
AUTOMATICA
2002
13 years 7 months ago
2002
In this paper, the problem concerning how to coordinate the contributions from concurrent controllers, when controlling mobile robots, is investigated. It is shown how a behavior ...
MST
2007
13 years 7 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...