Graph automata for linear graph languages (Q4645286): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-61228-9_97 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1598633555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear graph grammars: Power and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bounded degree problem for NLC grammars is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recontamination does not help to search a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of graphs by automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cellular graph automata. I. basic concepts, graph property measurement, closure properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:33, 17 July 2024

scientific article; zbMATH DE number 6999588
Language Label Description Also known as
English
Graph automata for linear graph languages
scientific article; zbMATH DE number 6999588

    Statements

    Graph automata for linear graph languages (English)
    0 references
    10 January 2019
    0 references
    0 references
    terminal node
    0 references
    input graph
    0 references
    node label
    0 references
    graph grammar
    0 references
    finite state automaton
    0 references
    0 references