scientific article; zbMATH DE number 7770055
From MaRDI portal
Publication:6070607
Publication date: 23 November 2023
Full work available at URL: http://www.jalc.de/issues/2023/issue_28_1-3/jalc-2023-143-166.php
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decidabilitypicture languagedescriptional complexityparsing complexityregular matrix grammartwo-dimensional context-free grammar
Cites Work
- Non-recursive trade-offs between two-dimensional automata and grammars
- Intersection non-emptiness and hardness within polynomial time
- Simple picture processing based on finite automata and regular grammars
- Two-dimensional pattern matching against basic picture languages
- Lengths of words accepted by nondeterministic finite automata
- Undecidability of the emptiness problem for context-free picture languages
- A CKY parser for picture grammars
- Fast context-free grammar parsing requires fast boolean matrix multiplication
- Finding a Minimum Circuit in a Graph
- On Non-Computable Functions
- Regular expressions and context-free grammars for picture languages
- Multiplying matrices faster than coppersmith-winograd
- Recognition and parsing of context-free languages in time n3
- An efficient context-free parsing algorithm
This page was built for publication:
