Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
47
views
8
references
Top references
cited by
20
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,337
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Aided Verification
Domain-Specific Optimization in Automata Learning
other
Author(s):
Hardi Hungar
,
Oliver Niese
,
Bernhard Steffen
Publication date
(Print):
2003
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
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
Multimodal Learning Material
Most cited references
8
Record
: found
Abstract
: not found
Article
: not found
Principles and methods of testing finite state machines-a survey
M Yannakakis
,
D. Lee
(1996)
0
comments
Cited
93
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Testing Software Design Modeled by Finite-State Machines
T.S. Chow
(1978)
0
comments
Cited
89
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
An Introduction to Computational Learning Theory
Michael Kearns
,
Umesh Vazirani
(1994)
0
comments
Cited
67
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2003
Pages
: 315-327
DOI:
10.1007/978-3-540-45069-6_31
SO-VID:
d942730e-e3dc-449b-a857-4143388f56d4
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 80
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
pp. 118
FAST: Fast Acceleration of Symbolic Transition Systems
pp. 141
A Symbolic Approach to Predicate Abstraction
pp. 167
Digitizing Interval Duration Logic
pp. 210
TLQSolver: A Temporal Logic Query Checker
pp. 223
Iterating Transducers in the Large
pp. 236
Algorithmic Improvements in Regular Model Checking
pp. 262
Thread-Modular Abstraction Refinement
pp. 315
Domain-Specific Optimization in Automata Learning
pp. 355
Theorem Proving Using Lazy Proof Explication
pp. 368
Enhanced Vacuity Detection in Linear Temporal Logic
Similar content
2,337
A Hierarchy of Polynomial-Time Computable Simulations for Automata
Authors:
Kousha Etessami
Ergodic properties of certain surjective cellular automata
Authors:
Mark Shereshevsky
On the equivalence of linear conjunctive grammars and trellis automata
Authors:
Alexander Okhotin
See all similar
Cited by
20
Model learning
Authors:
Frits Vaandrager
Inferring Canonical Register Automata
Authors:
Falk Howar
,
Bernhard Steffen
,
Bengt. Jonsson
…
On the Correspondence Between Conformance Testing and Regular Inference
Authors:
Therese Berg
,
Olga Grinchtein
,
Bengt. Jonsson
…
See all cited by