Ask
Search
My library
ORKG

ORKG Ask

Our mission is to organize scholarly knowledge and make it accessible to humans and machines.

About

About ORKG Ask
Report issue
Statistics
Contact

Legal

Terms of use
Data protection (sheet)
Imprint
Accessibility
License

Technical

We
open source
System status
Changelog
Frontend: v1.41.0
Backend: v1.13.4

We use cookies to provide a better user experience.

Data Protection

The correctness of Newman’s typability algorithm and some of its extensions

Geuvers, H.
Krebbers, R.

Publication date

January 2011

DOI

10.1016/j.tcs.2011.03.016

Publisher

Elsevier BV

ISSN

0304-3975

Abstract

Contains fulltext : 92446.pdf (preprint version ) (Open Access

Extracted data

Related items

Memory-based text correction for preposition and determiner errors

Bosch, A.P.J. van den
Berck, P.J.

January 2012

Contains fulltext : 2101867.pdf (publisher's version ) (Open Access

Computerising Mathematical Text

Kamareddine, F.
Wells, J.
Zengler, C.
Barendregt, H.

January 2014

Contains fulltext : 134655.pdf (preprint version ) (Open Access

Algorithms for Inferring Register Automata

Aarts, F.D.
Howar, F.
Kuppens, H.C.W.
Vaandrager, F.

January 2014

Contains fulltext : 132764.pdf (preprint version ) (Closed access

Evolving fixed-parameter tractable algorithms

Meer, S.A. van der
Rooij, I.J.E.I. van
Sprinkhuizen-Kuyper, I.G.

January 2008

Contains fulltext : 73145.pdf (publisher's version ) (Open Access

Brzozowski’s Algorithm (Co)Algebraically

Bonchi, F.
Bonsangue, M.
Rutten, J.
Silva, A.

January 2012

Contains fulltext : 93774.pdf (publisher's version ) (Closed access

The problem of unintelligibility

Hoop, H. de

January 2004

Contains fulltext : 214386.pdf (publisher's version ) (Closed access

Einführung in die Functionsweise des PLS-Algorithmus

Betzin, J.
Henseler, J.

January 2005

Contains fulltext : 46751.pdf (publisher's version ) (Open Access

The quest for correctness

Barendregt, H.P.

January 1996

Contains fulltext : 13361.pdf (publisher's version ) (Open Access

Proofs of correctness in Mathematics and Industry

Barendregt, H.P.

January 2009

Contains fulltext : 75959.pdf (author's version ) (Closed access

The problem of unintelligibility in OT semantics

Hoop, H. de

January 2001

Contains fulltext : M_161804.pdf (publisher's version ) (Open Access

Benchmarks for Automata Learning and Conformance Testing

Neider, D.
Smetsers, R.
Vaandrager, F.W.
Kuppens, H.C.W.

January 2019

Contains fulltext : 204557.pdf (preprint version ) (Closed access) ...

Slowly synchronizing automata with fixed alphabet size

Don, H.
Zantema, Hans
Bondt, Michiel de

January 2021

Contains fulltext : 236283.pdf (Publisher’s version ) (Closed access

Formal verification of a deadlock detection algorithm

Verbeek, F.
Schmaltz, J.

January 2011

Contains fulltext : 91833.pdf (preprint version ) (Open Access

Generating copybooks from consistent handwriting styles

Niels, R.M.J.
Vuurpijl, L.G.

January 2007

Contains fulltext : 57018.pdf (publisher's version ) (Open Access

Practical Formal Methods

Keiren, J.J.A.

January 2019

Contains fulltext : 207828.pdf (preprint version ) (Open Access

Memory-based text correction for preposition and determiner errors

Bosch, A.P.J. van den
Berck, P.J.

January 2012

Contains fulltext : 2101867.pdf (publisher's version ) (Open Access

Computerising Mathematical Text

Kamareddine, F.
Wells, J.
Zengler, C.
Barendregt, H.

January 2014

Contains fulltext : 134655.pdf (preprint version ) (Open Access

Algorithms for Inferring Register Automata

Aarts, F.D.
Howar, F.
Kuppens, H.C.W.
Vaandrager, F.

January 2014

Contains fulltext : 132764.pdf (preprint version ) (Closed access

Evolving fixed-parameter tractable algorithms

Meer, S.A. van der
Rooij, I.J.E.I. van
Sprinkhuizen-Kuyper, I.G.

January 2008

Contains fulltext : 73145.pdf (publisher's version ) (Open Access

Brzozowski’s Algorithm (Co)Algebraically

Bonchi, F.
Bonsangue, M.
Rutten, J.
Silva, A.

January 2012

Contains fulltext : 93774.pdf (publisher's version ) (Closed access

The problem of unintelligibility

Hoop, H. de

January 2004

Contains fulltext : 214386.pdf (publisher's version ) (Closed access

Einführung in die Functionsweise des PLS-Algorithmus

Betzin, J.
Henseler, J.

January 2005

Contains fulltext : 46751.pdf (publisher's version ) (Open Access

The quest for correctness

Barendregt, H.P.

January 1996

Contains fulltext : 13361.pdf (publisher's version ) (Open Access

Proofs of correctness in Mathematics and Industry

Barendregt, H.P.

January 2009

Contains fulltext : 75959.pdf (author's version ) (Closed access

The problem of unintelligibility in OT semantics

Hoop, H. de

January 2001

Contains fulltext : M_161804.pdf (publisher's version ) (Open Access

Benchmarks for Automata Learning and Conformance Testing

Neider, D.
Smetsers, R.
Vaandrager, F.W.
Kuppens, H.C.W.

January 2019

Contains fulltext : 204557.pdf (preprint version ) (Closed access) ...

Slowly synchronizing automata with fixed alphabet size

Don, H.
Zantema, Hans
Bondt, Michiel de

January 2021

Contains fulltext : 236283.pdf (Publisher’s version ) (Closed access

Formal verification of a deadlock detection algorithm

Verbeek, F.
Schmaltz, J.

January 2011

Contains fulltext : 91833.pdf (preprint version ) (Open Access

Generating copybooks from consistent handwriting styles

Niels, R.M.J.
Vuurpijl, L.G.

January 2007

Contains fulltext : 57018.pdf (publisher's version ) (Open Access

Practical Formal Methods

Keiren, J.J.A.

January 2019

Contains fulltext : 207828.pdf (preprint version ) (Open Access

Memory-based text correction for preposition and determiner errors

Bosch, A.P.J. van den
Berck, P.J.

January 2012

Contains fulltext : 2101867.pdf (publisher's version ) (Open Access

Computerising Mathematical Text

Kamareddine, F.
Wells, J.
Zengler, C.
Barendregt, H.

January 2014

Contains fulltext : 134655.pdf (preprint version ) (Open Access

Algorithms for Inferring Register Automata

Aarts, F.D.
Howar, F.
Kuppens, H.C.W.
Vaandrager, F.

January 2014

Contains fulltext : 132764.pdf (preprint version ) (Closed access