Sciweavers

6829 search results - page 360 / 1366
» Quantitative Generalizations of Languages
Sort
View
CORR
2011
Springer
162views Education» more  CORR 2011»
15 years 1 months ago
Isomorphism of regular trees and words
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
Markus Lohrey, Christian Mathissen
IUI
2011
ACM
14 years 9 months ago
Automatically generating stories from sensor data
Recent research in Augmented and Alternative Communication (AAC) has begun to make use of Natural Language Generation (NLG) techniques. This creates an opportunity for constructin...
Joseph Reddington, Nava Tintarev
POPL
2011
ACM
14 years 9 months ago
Precise reasoning for programs using containers
Containers are general-purpose data structures that provide functionality for inserting, reading, removing, and iterating over elements. Since many applications written in modern ...
Isil Dillig, Thomas Dillig, Alex Aiken
POPL
2012
ACM
14 years 2 months ago
An executable formal semantics of C with applications
This paper describes an executable formal semantics of C. Being executable, the semantics has been thoroughly tested against the GCC torture test suite and successfully passes 99....
Chucky Ellison, Grigore Rosu
ICFP
2012
ACM
13 years 9 months ago
Shake before building: replacing make with haskell
Most complex software projects are compiled using a build tool (e.g. make), which runs commands in an order satisfying userdefined dependencies. Unfortunately, most build tools r...
Neil Mitchell