24 search results - page 1 / 5 » A Process-Theoretic Look at Automata |
FSEN
2009
Springer
13 years 11 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
SOFSEM
2012
Springer
12 years 12 days ago
2012
Springer
Visibly Pushdown Transducers (VPT) form a subclass of pushdown transducers. In this paper, we investigate the extension of VPT with visibly pushdown look-ahead (VPTla). Their trans...
IJFCS
2008
13 years 4 months ago
2008
In this paper, we look at the extension of Hedlund's characterization of cellular automata to the case of cellular automata in the hyperbolic plane. This requires an addition...
ATVA
2011
Springer
12 years 4 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
CORR
2011
Springer
12 years 12 months ago
2011
Springer
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...