Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Grammatical codes of trees

From MaRDI portal
Publication:1179181
Jump to:navigation, search

DOI10.1016/0166-218X(91)90095-EzbMath0737.68050OpenAlexW2073812406MaRDI QIDQ1179181

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 26 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90095-e


zbMATH Keywords

treesgrammarscodes


Mathematics Subject Classification ID

Formal languages and automata (68Q45)


Related Items (4)

Semantics of trees ⋮ Generating binary trees in A-order from codewords defined on a four-letter alphabet ⋮ A note on binary grammatical codes of trees ⋮ Properties of grammatical codes of trees



Cites Work

  • Unnamed Item
  • Quasi-Monotonic Sequences: Theory, Algorithms and Applications
  • The Sequence Equivalence Problem is Decidable for 0S Systems


This page was built for publication: Grammatical codes of trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1179181&oldid=12028562"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 29 January 2024, at 23:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki