303 search results - page 16 / 61 » Automata on Gauss Words |
CSL
2008
Springer
13 years 11 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
CAGD
2006
13 years 9 months ago
2006
In this paper, we study the convergent property of a well known discretized scheme of Gaussian curvature, derived from Gauss-Bonnet theorem, over triangulated surface. Suppose the...
MFCS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have nite words with no preimage (called orphans), pairs of dieren...
FSMNLP
2005
Springer
14 years 3 months ago
2005
Springer
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
SIMULATION
2002
13 years 9 months ago
2002
Trend is a two dimensional cellular automata programming environment with an integrated simulator and a compiler. Trend has many unique features such as simulation backtracking, c...