Sciweavers

38 search results - page 7 / 8
» Minimizing Deterministic Lattice Automata
Sort
View
DLT
2007
13 years 9 months ago
State Complexity of Union and Intersection of Finite Languages
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
Yo-Sub Han, Kai Salomaa
ICDCS
2009
IEEE
14 years 4 months ago
Characterization and Solution to a Stateful IDS Evasion
We identify a new type of stateful IDS evasion, named signature evasion. We formalize the signature evasion on those Stateful IDSs whose state can be modeled using Deterministic F...
Issam Aib, Tung Tran, Raouf Boutaba
CSL
2002
Springer
13 years 7 months ago
Weighted finite-state transducers in speech recognition
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
Mehryar Mohri, Fernando Pereira, Michael Riley
ICS
2010
Tsinghua U.
14 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
CEC
2003
IEEE
14 years 22 days ago
An evolutionary approach to microstructure optimisation of stereolithographic models
The aim of this work is to utilize an evolutationary algorithm to evolve the microstructure of an object created by a stereolithography machine. This should be optimised to be able...
Siavash Haroun Mahdavi, Sean Hanna