164 search results - page 31 / 33 » Quotient Complexity of Regular Languages |
COGSCI
2008
14 years 9 months ago
2008
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...
COCO
2010
Springer
14 years 11 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
CGF
2006
14 years 9 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
PARA
2000
Springer
15 years 1 months ago
2000
Springer
The JavaGrande Forum is a group of users, researchers, and interested parties from industry. The Forum members are either trying to use Java for resource-intensive applications or ...
EUROSYS
2007
ACM
15 years 6 months ago
2007
ACM
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...