1418 search results - page 49 / 284 » The Dynamic Complexity of Formal Languages |
142
click to vote
EUROCAST
2007
Springer
15 years 8 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
129
click to vote
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, asso...
149
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
119
click to vote
ASM
2000
ASM
15 years 8 months ago
2000
ASM
Abstract. The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the ...
140
click to vote
AIIA
2005
Springer
15 years 6 months ago
2005
Springer
Incremental processing is relevant for language modeling, speech recognition and language generation. In this paper we devise a dynamic version of Tree Adjoining Grammar (DVTAG) th...