3653 search results - page 6 / 731 » On Recognizable Timed Languages |
SOFSEM
2010
Springer
15 years 6 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...
85
Voted
CAI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
103
click to vote
JACM
2000
14 years 9 months ago
2000
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider languages of labelled N-free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only ...
DLT
2003
14 years 11 months ago
2003
Past proposals for applying to pictures or 2D languages the generative grammar approach do not match in our opinion the elegance and descriptive adequacy that made Context Free gr...