Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 919846

From MaRDI portal
Jump to:navigation, search

zbMATH Open0854.68046MaRDI QIDQ4890711FDOQ4890711


Authors: Frank Drewes Edit this on Wikidata


Publication date: 25 August 1996



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 1456955
  • scientific article; zbMATH DE number 1696443
  • scientific article; zbMATH DE number 3965457
  • Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
  • FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science


zbMATH Keywords

tree transducersperform symbolic computations


Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)



Cited In (3)

  • Branching synchronization grammars with nested tables
  • Decidability of the finiteness of ranges of tree transductions
  • The complexity of the exponential output size problem for top-down and bottom-up tree transducers





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 Q4890711)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4890711&oldid=19269411"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 05:28. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki