227 search results - page 7 / 46 » P Systems and Finite Automata |
124
click to vote
SAGA
2007
Springer
16 years 1 days ago
2007
Springer
A two-way finite automaton is sweeping if its input head can change direction only on the end-markers. For each n ≥ 2, we exhibit a problem that can be solved by a O(n2 )-state ...
142
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Pattern matching relies on deterministic finite automata (DFA) to search for predefined patterns. While a bit-DFA method is recently proposed to exploit the parallelism in pattern...
164
click to vote
FSMNLP
2005
Springer
15 years 11 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...
156
click to vote
KAIS
2006
15 years 5 months ago
2006
Our objective is spoken language classification for helpdesk call routing using a scanning understanding and intelligent system techniques. In particular, we examine simple recurre...