Context-sensitive string languages and recognizable picture languages
From MaRDI portal
Recommendations
- Families of automata characterizing context-sensitive languages
- Chomsky-Schützenberger-type characterization of multiple context-free languages
- Publication:3468622
- Classification of string languages via tiling recognizable picture languages
- On ``inherently context-sensitive languages -- an application of complexity cores
Cites work
- scientific article; zbMATH DE number 3738961 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- Algebraic automata and context-free sets
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Picture languages with array rewriting rules
- Recognizable picture languages and domino tiling
- Some properties of two-dimensional on-line tessellation acceptors
Cited in
(13)- scientific article; zbMATH DE number 7770057 (Why is no real title available?)
- From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
- Recognizable vs. Regular Picture Languages
- Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
- Consensus game acceptors
- Traces of term-automatic graphs
- Decision problems and projection languages for restricted variants of two-dimensional automata
- Consensus game acceptors and iterated transductions
- Iteration of rational transductions
- scientific article; zbMATH DE number 7584603 (Why is no real title available?)
- Infinite games with finite knowledge gaps
- A logical approach to locality in pictures languages
- Picture codes
This page was built for publication: Context-sensitive string languages and recognizable picture languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376420)
