Infinite arrays and controlled deterministic table 0L array systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3880129 (Why is no real title available?)
- scientific article; zbMATH DE number 3658971 (Why is no real title available?)
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3501028 (Why is no real title available?)
- Avoidable patterns in strings of symbols
- Extended controlled table L-arrays
- Infinite arrays and infinite computations
- On infinite words obtained by iterating morphisms
- Picture languages with array rewriting rules
- Pictures of functions and their acceptability by automata
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
Cited in
(5)
This page was built for publication: Infinite arrays and controlled deterministic table 0L array systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797993)