Sciweavers

2465 search results - page 3 / 493
» Automata on Linear Orderings
Sort
View
LICS
2012
IEEE
12 years 11 months ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan
IJBC
2007
39views more  IJBC 2007»
14 years 9 months ago
Optimal CNN Templates for Linearly-Separable One-Dimensional Cellular Automata
In this tutorial, we present optimal Cellular Nonlinear Network (CNN) templates for implementing linearly-separable one-dimensional (1-D) Cellular Automata (CA). From the gallery ...
P. J. Chang, Bharathwaj Muthuswamy
TCS
2010
14 years 4 months ago
Definable transductions and weighted logics for texts
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
Christian Mathissen
CAV
2004
Springer
130views Hardware» more  CAV 2004»
15 years 1 months ago
Global Model-Checking of Infinite-State Systems
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
Nir Piterman, Moshe Y. Vardi
IPL
2008
147views more  IPL 2008»
14 years 9 months ago
Streaming tree automata
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
Olivier Gauwin, Joachim Niehren, Yves Roos