644 search results - page 21 / 129 » Precedence Automata and Languages |
ACTA
2006
13 years 7 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
We introduce a model of automaton for picture language recognition which is based on tiles and is called Wang automaton, since its description relies on the notation of Wang system...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
ICFCA
2009
Springer
14 years 2 months ago
2009
Springer
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
MFCS
2007
Springer
14 years 1 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...