Amanote Research

Amanote Research

    RegisterSign In

Composing Message Translators and Inferring Their Data Types Using Tree Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-46675-9_3
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2015

Authors
Emil AndriescuThierry MartinezValérie Issarny
Publisher

Springer Berlin Heidelberg


Related search

Inferring a Message Through Capitalization

US-China Foreign Language
2019English

Modeling and Synthesis of Service Composition Using Tree Automata

2008English

Relating Word and Tree Automata

Annals of Pure and Applied Logic
Logic
2006English

Predicate Logic and Tree Automata With Tests

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Hyper-Minimization for Deterministic Tree Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

Tree Automata Make Ordinal Theory Easy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Inferring Relevant Cell Types for Complex Traits by Using Single-Cell Gene Expression

American Journal of Human Genetics
Genetics
2017English

Random Generation of Deterministic Tree (Walking) Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

AEESPAN: Automata Based Energy Efficient Spanning Tree for Data Aggregation in Wireless Sensor Networks

Wireless Sensor Network
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy