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

Recognition of graphs by automata

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

DOI10.1016/0304-3975(94)00045-KzbMath0874.68230MaRDI QIDQ1349690

Eric Rémila

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)



Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)


Related Items (2)

Graph automata for linear graph languages ⋮ Finite graph automata for linear and boundary graph languages




Cites Work

  • An 8-state minimal time solution to the firing squad synchronization problem
  • Cellular graph automata. I. basic concepts, graph property measurement, closure properties
  • Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition




This page was built for publication: Recognition of graphs by automata

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