scientific article; zbMATH DE number 7298596
From MaRDI portal
Publication:5145160
zbMATH Open1455.68070arXiv0906.3208MaRDI QIDQ5145160FDOQ5145160
Publication date: 20 January 2021
Full work available at URL: https://arxiv.org/abs/0906.3208
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Grammars and rewriting systems (68Q42) Cellular automata (computational aspects) (68Q80)
Recommendations
- A simple P-complete problem and its language-theoretic representations π π
- DNA Computing π π
- On the computational complexity of P automata π π
- Generating Small Automata and the ΔernΓ½ Conjecture π π
- Some computational limits of trellis automata π π
- A Simple P-Complete Problem and Its Representations by Language Equations π π
- On a representation of tree automata π π
- Exact complexity of problems of incompletely specified automata π π
- Descriptional and computational complexity of the circuit representation of finite automata π π
- Tight Bounds for Complementing Parity Automata π π
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145160)
