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

Finding DFAs with Maximal Shortest Synchronizing Word Length

Don, H.
Zantema, H.

Publication date

January 2017

DOI

10.1007/978-3-319-53733-7_18

Publisher

Springer Science and Business Media LLC

ISSN

0302-9743

Language

English

Citation count (estimate)

2

Abstract

Contains fulltext : 173189.pdf (preprint version ) (Open Access) Contains fulltext : 173189pub.pdf (publisher's version ) (Closed access

Extracted data

Related items

DFAs and PFAs with long shortest synchronizing word length

Bondt, M De
Don, H
Zantema, H Hans

January 2017

\u3cp\u3eIt was conjectured by Černý in 1964, that a synchronizing DFA on n states always has a sync...

Slowly synchronizing automata with fixed alphabet size

Don, Henk
Zantema, Hans
de Bondt, Michiel

August 2021

It was conjectured by Černý in 1964 that a synchronizing DFA on n states always has a shortest synch...

Synchronizing automata with finitely many minimal synchronizing words

Pribavkina, Elena V.
Rodaro, Emanuele

March 2011

AbstractA synchronizing word for a given synchronizing DFA is called minimal if none of its proper f...

DFAs and PFAs with Long Shortest Synchronizing Word Length

Bondt, M. de
Don, H.
Zantema, H.

January 2017

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

Finding DFAs with maximal shortest synchronizing word length

Zantema, H.
Don, H.

January 2017

It was conjectured by Černý in 1964 that a synchronizing DFA on n states always has a shortest synch...

Lower bounds for synchronizing word lengths in partial automata

de Bondt, M.
Don, H.M.
Zantema, Hans

January 2019

It was conjectured by Černý in 1964, that a synchronizing DFA on nn states always has a synchronizin...

Synchronizing non-deterministic finite automata

Don, Henk
Zantema, Hans

January 2018

In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same sy...

DFAs and PFAs with long shortest synchronizing word length

Bondt, M De
Don, H
Zantema, H Hans

January 2017

\u3cp\u3eIt was conjectured by Černý in 1964, that a synchronizing DFA on n states always has a sync...

Slowly synchronizing automata with fixed alphabet size

Don, Henk
Zantema, Hans
de Bondt, Michiel

August 2021

It was conjectured by Černý in 1964 that a synchronizing DFA on n states always has a shortest synch...

Synchronizing automata with finitely many minimal synchronizing words

Pribavkina, Elena V.
Rodaro, Emanuele

March 2011

AbstractA synchronizing word for a given synchronizing DFA is called minimal if none of its proper f...

DFAs and PFAs with Long Shortest Synchronizing Word Length

Bondt, M. de
Don, H.
Zantema, H.

January 2017

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

Finding DFAs with maximal shortest synchronizing word length

Zantema, H.
Don, H.

January 2017

It was conjectured by Černý in 1964 that a synchronizing DFA on n states always has a shortest synch...

Lower bounds for synchronizing word lengths in partial automata

de Bondt, M.
Don, H.M.
Zantema, Hans

January 2019

It was conjectured by Černý in 1964, that a synchronizing DFA on nn states always has a synchronizin...

Synchronizing non-deterministic finite automata

Don, Henk
Zantema, Hans

January 2018

In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same sy...

DFAs and PFAs with long shortest synchronizing word length

Bondt, M De
Don, H
Zantema, H Hans

January 2017

\u3cp\u3eIt was conjectured by Černý in 1964, that a synchronizing DFA on n states always has a sync...

Slowly synchronizing automata with fixed alphabet size

Don, Henk
Zantema, Hans
de Bondt, Michiel

August 2021

It was conjectured by Černý in 1964 that a synchronizing DFA on n states always has a shortest synch...

Synchronizing automata with finitely many minimal synchronizing words

Pribavkina, Elena V.
Rodaro, Emanuele

March 2011

AbstractA synchronizing word for a given synchronizing DFA is called minimal if none of its proper f...