Sciweavers

644 search results - page 41 / 129
» Precedence Automata and Languages
Sort
View
DLT
2008
15 years 1 months ago
Construction of Tree Automata from Regular Expressions
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
Dietrich Kuske, Ingmar Meinecke
SFP
2003
15 years 27 days ago
FSM-Hume is finite state
Abstract Hume is a domain-specific programming language targeting resourcebounded computations. It is based on generalised concurrent bounded automata, controlled by transitions c...
Greg Michaelson, Kevin Hammond, Jocelyn Sér...
JUCS
2002
101views more  JUCS 2002»
14 years 11 months ago
Descriptional Complexity of Machines with Limited Resources
: Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of diff...
Jonathan Goldstine, Martin Kappes, Chandra M. R. K...
KAIS
2006
229views more  KAIS 2006»
14 years 11 months ago
Call classification using recurrent neural networks, support vector machines and finite state automata
Our objective is spoken language classification for helpdesk call routing using a scanning understanding and intelligent system techniques. In particular, we examine simple recurre...
Sheila Garfield, Stefan Wermter
FUIN
2002
99views more  FUIN 2002»
14 years 11 months ago
On Interacting Automata with Limited Nondeterminism
One-way and two-way cellular language acceptors with restricted nondeterminism are investigated. The number of nondeterministic state transitions is regarded as limited resource wh...
Thomas Buchholz, Andreas Klein, Martin Kutrib