Recognizing picture languages by reductions to string languages
From MaRDI portal
Publication:5867524
Authors: František Mráz, Friedrich Otto 
Publication date: 14 September 2022
Full work available at URL: http://www.jalc.de/issues/2022/issue_27_1-3/jalc-2022-199-228.php
Recommendations
Cites Work
- Multiplying matrices faster than coppersmith-winograd
- Complexity of two-dimensional patterns
- Context-sensitive string languages and recognizable picture languages
- Fast context-free grammar parsing requires fast Boolean matrix multiplication
- Recent advances in formal languages and applications.
- A computational model for tiling recognizable two-dimensional languages
- Monotonicity of restarting automata
- One-tape, off-line Turing machine computations
- LR-regular grammars - an extension of LR(k) grammars
- Using string languages to describe picture languages
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
- Picture languages with array rewriting rules
- On regular drawn symbolic picture languages
- Ordered restarting automata for picture languages
- Two-dimensional sgraffito automata
- Restarting automata for picture languages: a survey on recent developments
- Picture recognizability with automata based on Wang tiles
- Two-dimensional Sgraffito automata
- New results on deterministic sgraffito automata
- Comparing two-dimensional one-marker automata to sgraffito automata
- Extended two-way ordered restarting automata for picture languages
- Deterministic ordered restarting automata for picture languages
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Linear Context Free Languages
- If the current clique algorithms are optimal, so is Valiant's parser
- Recognition and complexity results for projection languages of two-dimensional automata
- Intersection non-emptiness and hardness within polynomial time
- Scanning pictures the boustrophedon way
- Two-dimensional pattern matching against basic picture languages
- Two-head finite-state acceptors with translucent letters
- On deterministic ordered restart-delete automata
- On deterministic ordered restart-delete automata
- Globally deterministic CD-systems of stateless R-automata with window size 1
Cited In (1)
This page was built for publication: Recognizing picture languages by reductions to string languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5867524)
