Sequences of words defined by two-way transducers (Q728270)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Sequences of words defined by two-way transducers	scientific article

Statements

scholarly article

Sequences of words defined by two-way transducers (English)

Christian Choffrut

Theoretical Computer Science

publication date

19 December 2016

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.tcs.2016.05.004

Hopcroft's algorithm and tree-like automata

Uniformisation of Two-Way Transducers

MSO definable string transductions and two-way finite-state transducers

The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable

Characteristic Sturmian words are extremal for the critical factorization theorem

A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY

A note on Sturmian words

The Shuffle Product: New Research Directions

On the product of balanced sequences

Identifiers

zbMATH Open document ID

10.1016/j.tcs.2016.05.004

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:728270

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q728270&oldid=36295833"