DLT
2006
13 years 5 months ago
2006
ract State Machines Be Useful in Language Theory? Yuri Gurevich a Margus Veanes a Charles Wallace b aMicrosoft Research, Redmond, Washington, USA bMichigan Tech, Houghton, Michigan...
DLT
2006
13 years 5 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
DLT
2006
13 years 5 months ago
2006
We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and -synchronous for two different numbers and , then it is recognizab...
DLT
2006
13 years 5 months ago
2006
Bag context is a device for regulated rewriting in tree and string grammars. It represents context that is not part of the developing tree or string, but evolves on its own during ...
DLT
2006
13 years 5 months ago
2006
DLT
2006
13 years 5 months ago
2006
The paradigm of evolution/observation is based on the idea that a computing device can be obtained by combining a basic system and an observer that transforms the evolution of the ...
DLT
2006
13 years 5 months ago
2006
Abstract. We introduce the synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word. The visibly pushdown automata are the autom...
DLT
2004
13 years 5 months ago
2004
DLT
2004
13 years 5 months ago
2004
A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NPcomplete. The fragment is larger than previously kn...
DLT
2004
13 years 5 months ago
2004
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...