scientific article; zbMATH DE number 7584603
From MaRDI portal
Publication:5867524
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Deterministic ordered restarting automata for picture languages
- A computational model for tiling recognizable two-dimensional languages
- Complexity of two-dimensional patterns
- Context-sensitive string languages and recognizable picture languages
- Intersection non-emptiness and hardness within polynomial time
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
- On regular drawn symbolic picture languages
- Recognition and complexity results for projection languages of two-dimensional automata
- Two-dimensional pattern matching against basic picture languages
- Two-head finite-state acceptors with translucent letters
- Recent advances in formal languages and applications.
- LR-regular grammars - an extension of LR(k) grammars
- Scanning Pictures the Boustrophedon Way
- Globally deterministic CD-systems of stateless R-automata with window size 1
- Ordered Restarting Automata for Picture Languages
- Two-Dimensional Sgraffito Automata
- Restarting Automata for Picture Languages: A Survey on Recent Developments
- Fast context-free grammar parsing requires fast boolean matrix multiplication
- Picture Recognizability with Automata Based on Wang Tiles
- Linear Context Free Languages
- Using string languages to describe picture languages
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
- Two-dimensional Sgraffito automata
- New Results on Deterministic Sgraffito Automata
- Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Extended Two-Way Ordered Restarting Automata for Picture Languages
- Multiplying matrices faster than coppersmith-winograd
- One-tape, off-line Turing machine computations
- Picture languages with array rewriting rules
- On deterministic ordered restart-delete automata
- On deterministic ordered restart-delete automata
This page was built for publication:
