Amanote Research

Amanote Research

    RegisterSign In

LearnLib Tutorial: From Finite Automata to Register Interface Programs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-34026-0_43
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2012

Authors
Falk HowarMalte IsbernerMaik MertenBernhard Steffen
Publisher

Springer Berlin Heidelberg


Related search

From Control-Command Synchronous Programs to Hybrid Automata

IFAC Proceedings Volumes
2012English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

Introduction to the Theory of Finite Automata

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1967English

A Tutorial on Synthesis of Logic Programs From Specifications

1994English

Learning Stochastic Finite Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Tutorial Notes: Reasoning About Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

To Cryptanalysis of 2-Cascade Finite Automata Cryptographic Generators

Prikladnaya diskretnaya matematika. Prilozhenie
2016English

Programs With Lists Are Counter Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2011English

Simulations Between Programs as Cellular Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy