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

Application of the graph cellular automaton in generating languages

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

DOI10.1016/J.MATCOM.2019.07.010OpenAlexW2968942426MaRDI QIDQ1997874

B. Praba, R. Saranya

Publication date: 6 March 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2019.07.010


zbMATH Keywords

finite automatoncellular automatoncomplete graphbasic linear rulesgraph cellular automaton


Mathematics Subject Classification ID

Graph theory (05Cxx)





Cites Work

  • Asymptotic Laplacian-energy-like invariant of lattices
  • Cellular automata on graphs: topological properties of ER graphs evolved towards low-entropy dynamics
  • Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
  • Edge Detection Using Cellular Automata




This page was built for publication: Application of the graph cellular automaton in generating languages

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