Context-Sensitive Languages, Rational Graphs and Determinism
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1834676
- Context-sensitive languages and G-automata
- scientific article; zbMATH DE number 3990900
- The synchronized graphs trace the context-sensitive languages
- Logical description of context-free graph languages
- scientific article; zbMATH DE number 6004833
- On ``inherently context-sensitive languages -- an application of complexity cores
- Context semantics, linear logic, and computational complexity
- scientific article; zbMATH DE number 3909759
- scientific article; zbMATH DE number 1836424
Cited in
(13)- On ``inherently context-sensitive languages -- an application of complexity cores
- Non-perturbative graph languages, halting problem and complexity
- The synchronized graphs trace the context-sensitive languages
- Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
- Traces of Term-Automatic Graphs
- A Hierarchy of Automaticω-Words having a Decidable MSO Theory
- Traces of term-automatic graphs
- An Infinite Automaton Characterization of Double Exponential Time
- scientific article; zbMATH DE number 1836424 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2005
- A class of rational trace relations closed under composition
- Linearly bounded infinite graphs
- On the separability of sparse context-free languages and of bounded rational relations
This page was built for publication: Context-Sensitive Languages, Rational Graphs and Determinism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310659)
