Record: found
Abstract: not found
Book Chapter: not found

A Fresh Approach to Learning Register Automata

other

Author(s): Benedikt Bollig , Peter Habermehl , Martin Leucker , Benjamin Monmege

Publication date (Print): 2013

Publisher: Springer Berlin Heidelberg

Read this book at

Publisher

Buy book

Bookmark

There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 23

Record: found
Abstract: not found
Article: not found

A calculus of mobile processes, I

Robin Milner, Joachim Parrow, David Michael Walker (1992)

0 comments Cited 229 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Finite-memory automata

Michael Kaminski, Nissim Francez (1994)

0 comments Cited 76 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Finite state machines for strings over infinite alphabets

Victor Vianu, Frank Neven, Thomas Schwentick (2004)

0 comments Cited 49 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2013

Pages: 118-130

DOI: 10.1007/978-3-642-38771-5_12

SO-VID: a1927747-5941-4e5f-a592-bcb20e676789

History

Data availability:

A Fresh Approach to Learning Register Automata

Read this book at

Related collections

Multimodal Learning Material

Most cited references 23

A calculus of mobile processes, I

Finite-memory automata

Finite state machines for strings over infinite alphabets

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 4,013

Cited by 6