scientific article; zbMATH DE number 7268103
From MaRDI portal
Publication:5130734
DOI10.23638/DMTCS-22-1-3zbMath1490.68174arXiv1903.09905MaRDI QIDQ5130734
No author found.
Publication date: 28 October 2020
Full work available at URL: https://arxiv.org/abs/1903.09905
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds for the D0L language equivalence problem
- Bounded D0L languages
- A note on DOL length sets
- The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
- Some remarks about stabilizers
- On Infinite Words Determined by Stack Automata.
- Automatic Sequences
- A bound for theω-equivalence problem of polynomial D0L systems
- On infinite words generated by polynomial D0L systems
This page was built for publication: