Word-Mappings of Level 2

Authors:
Julien Ferté;Nathalie Marin;Géraud Sénizergues
Affiliations:
LIF, Université d'Aix-Marseille 1, Marseille, France;LaBRI, Université Bordeaux 1, Bordeaux, France;LaBRI, Université Bordeaux 1, Bordeaux, France
Venue:
Theory of Computing Systems
Year:
2014

An automata-theoretical characterization of the OI-hierarchy

Information and Control
Pushdown machines for the macro tree transducer

Theoretical Computer Science
String-rewriting systems

String-rewriting systems
A shrinking lemma for indexed languages

Theoretical Computer Science
L systems

Handbook of formal languages, vol. 1
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
A Class of Functions Computable by Index Grammars

Cybernetics and Systems Analysis
Tree transducers, L systems and two-way machines (Extended Abstract)

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An efficient algorithm for solving word equations

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Linear orders in the pushdown hierarchy

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Sequences of level 1, 2, 3,..., k,...

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Hi-index	0.00