Word-mappings of level 2
From MaRDI portal
Publication:2441544
Recommendations
Cites work
- A class of functions computable by index grammars
- A shrinking lemma for indexed languages
- An automata-theoretical characterization of the OI-hierarchy
- An efficient algorithm for solving word equations
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- scientific article; zbMATH DE number 5643878 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3495606 (Why is no real title available?)
- scientific article; zbMATH DE number 3577484 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- scientific article; zbMATH DE number 3363457 (Why is no real title available?)
- Iterated pushdown automata and sequences of rational numbers
- Linear Orders in the Pushdown Hierarchy
- On derivation trees of indexed grammars - an extension of the uvwxy- theorem
- On the decomposition of \(k\)-valued rational relations
- Pushdown machines for the macro tree transducer
- Rational sets in commutative monoids
- Sequences of Level 1, 2, 3,..., k,...
- Tree transducers, L systems, and two-way machines
Cited in
(10)- The complexity of solution sets to equations in hyperbolic groups
- Iterated pushdown automata and sequences of rational numbers
- More than 1700 years of word equations
- On the Images of ℕ-Rational Sequences Counting Multiplicities
- Solutions to twisted word equations and equations in virtually free groups
- Solution sets for equations over free groups are EDT0L languages
- Sequences of Level 1, 2, 3,..., k,...
- On polynomial recursive sequences
- On polynomial recursive sequences
- Comparison-free polyregular functions
This page was built for publication: Word-mappings of level 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441544)
