ICALP 2000 - PDF Preprint Papers

ICALP 2000 International Colloquium on Automata

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICALP-2000 Paper

click to vote

ICALP
2000
Springer

173views Programming Languages» more ICALP 2000»

On the Power of Tree-Walking Automata

13 years 8 months ago

Download alpha.uhasselt.be

Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...

Frank Neven, Thomas Schwentick

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	173	On the Power of Tree-Walking Automata	claim
2	148	Parallel Machine Scheduling Problems with Controllable Processing Times	claim
3	147	Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System	claim
4	139	One-Round Secure Computation and Secure Autonomous Mobile Agents	claim
5	134	Average Bit-Complexity of Euclidean Algorithms	claim
6	129	Formalizing the Development of Agent-Based Systems Using Graph Processes	claim
7	127	A Generic Model for Diagram Syntax and Semantics	claim
8	124	Computing the Girth of a Planar Graph	claim
9	120	Amalgamation of Transition Sequences in the PEPA Formalism	claim
10	118	Efficient Verification Algorithms for One-Counter Processes	claim
11	116	Generating Partial and Multiple Transversals of a Hypergraph	claim
12	115	Algebraic Models for Contextual Nets	claim
13	115	Reasoning about Idealized ALGOL Using Regular Languages	claim
14	115	Decidable First-Order Transition Logics for PA-Processes	claim
15	114	Extended Notions of Security for Multicast Public Key Cryptosystems	claim
16	113	An Optimal Minimum Spanning Tree Algorithm	claim
17	112	A Statically Allocated Parallel Functional Language	claim
18	107	Lax Logical Relations	claim
19	105	Constraint Programming and Graph Algorithms	claim
20	104	A Matrix-based Method for Analysing Stochastic Process Algebras	claim
21	103	Approximate TSP in Graphs with Forbidden Minors	claim
22	101	A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols	claim
23	100	Graph Transformations on the UML Metamodel	claim
24	100	Hardness of Set Cover with Intersection 1	claim
25	98	Scalable Secure Storage when Half the System Is Faulty	claim
26	94	Temporal Rewards for Performance Evaluation	claim
27	92	The Many Faces of a Translation	claim
28	88	A New Unfolding Approach to LTL Model Checking	claim
29	85	Two-coloring Random Hypergraphs	claim
30	79	On Message Sequence Graphs and Finitely Generated Regular MSC Languages	claim
31	77	Tight Size Bounds for Packet Headers in Narrow Meshes	claim
32	73	Routing Tree Problems on Random Graphs	claim
33	71	On the Representation of Timed Polyhedra	claim
34	68	Dispersing Hash Functions	claim
35	59	Optimal Projective Algorithms for the List Update Problem	claim
36	58	LTL Is Expressively Complete for Mazurkiewicz Traces	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers