4666 search results - page 63 / 934 » Equations on Timed Languages |
SCP
1998
13 years 10 months ago
1998
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
IWPSE
2005
IEEE
14 years 4 months ago
2005
IEEE
Humans will have to live with software for a long time. As demonstrated by the Y2K problem, computer professionals used a wrong time scale when thinking about software. Large soft...
EMSOFT
2006
Springer
14 years 2 months ago
2006
Springer
We describe a simple scheme for mapping synchronous language models, in the form of Boolean Mealy Machines, into timed automata. The mapping captures certain idealized implementat...
MFCS
2007
Springer
14 years 5 months ago
2007
Springer
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
TAPSOFT
1997
Springer
14 years 2 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...