Deque automata, languages, and planar graph representations
From MaRDI portal
Publication:2192371
Recommendations
Cites work
- A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers)
- AFL with the semilinear property
- Automates a file
- BREADTH AND DEPTH GRAMMARS AND DEQUE AUTOMATA
- Data Structures and their Planar Graph Layouts
- Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages
- Deque languages, automata and planar graphs
- Disjunctivity and other properties of sets of pseudo-bordered words
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3492580 (Why is no real title available?)
- scientific article; zbMATH DE number 1796967 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- New Real-Time Simulations of Multihead Tape Units
- QRT FIFO automata, breadth-first grammars and their relations
- Queue Automata: Foundations and Developments
- Toroidal embeddings of abstractly planar graphs are knotted or linked
- Über einen Automaten mit Pufferspeicherung
Cited in
(5)
This page was built for publication: Deque automata, languages, and planar graph representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192371)