Circular Sturmian words and Hopcroft's algorithm
type: Item
instance of: scholarly article
title: Circular Sturmian words and Hopcroft's algorithm
zbMATH Open document ID: 1187.68360
author: Antonio Restivo
author: G. Castiglione
author: M. Sciortino
published in: Theoretical Computer Science
publication date: 2009-10-09T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5612525
zbMATH Keywords: deterministic finite state automata
zbMATH Keywords: Hopcroft's minimization algorithm
zbMATH Keywords: circular Sturmian words
zbMATH Keywords: Sturmian morphisms
describes a project that uses: AMoRE
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.07.018
OpenAlex ID: W2157313018
cites work: Q2959876
cites work: Implementation and Application of Automata
cites work: Q4430300
cites work: On an involution of Christoffel words and Sturmian morphisms
cites work: On Christoffel classes
cites work: Q5725992
cites work: Hopcroft’s Algorithm and Cyclic Automata
cites work: Q4079524
cites work: Repetitions in Sturmian strings
cites work: Q4040797
cites work: Describing an algorithm by Hopcroft
cites work: Q4045961
cites work: Characterisations of balanced words via orderings
cites work: Re-describing an algorithm by Hopcroft
cites work: Q4529547
cites work: Minimisation of acyclic deterministic automata in linear time
cites work: The On-Line Encyclopedia of Integer Sequences
DOI: 10.1016/J.TCS.2009.07.018
description: scientific article; zbMATH DE number 5612525