423 search results - page 38 / 85 » The Generalization of Generalized Automata: Expression Autom... |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
GEOINFO
2003
13 years 10 months ago
2003
One of the main challenges for the development of spatial information theory is the formalization of the concepts of space and spatial relations. Currently, most spatial data struc...
ICFP
2005
ACM
14 years 8 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
WIA
2001
Springer
14 years 1 months ago
2001
Springer
A formal device is said to be adaptive whenever its behavior changes dynamically, in a direct response to its input stimuli, without interference of external agents, even its user...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...