Filters








80 Hits in 5.0 sec

Cellular graph automata. II. graph and subgraph isomorphism, graph structure recognition

Angela Wu, Azriel Rosenfeld
1979 Information and Control  
The paper also examines types of graph structures that can be recognized by these automata.  ...  This paper deals with cellular automata in which the intercell connections define a graph of bounded degree.  ...  Section 4 discusses types of graph structures that can be recognized by such automata.  ... 
doi:10.1016/s0019-9958(79)90296-1 fatcat:4zd4obna4beo5mxa2yoehsw22q

Finite graph automata for linear and boundary graph languages

F.J. Brandenburg, K. Skodinis
2005 Theoretical Computer Science  
Here we introduce graph automata as devices for the recognition of sets of undirected node labelled graphs.  ...  Finally, we generalize some automata theoretic properties from string to graph automata, integrate the connectivity of graphs into graph automata, and explain why graph automata cannot be generalized to  ...  This approach is used for cellular automata and for an analysis of communication structures and computer networks.  ... 
doi:10.1016/j.tcs.2004.09.040 fatcat:qkdx5zvgq5cdfgshrwihqhpt7y

PROBABILISTIC RECONSTRUCTION OF ORTHODOX CHURCHES FROM PRECISION POINT CLOUDS USING BAYESIAN NETWORKS AND CELLULAR AUTOMATA

M. Chizhova, D. Korovin, A. Gurianov, M. Brodovskii, A. Brunn, U. Stilla, T. Luhmann
2017 The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
In a simulated example we reconstruct a complete Russian-orthodox church starting from the set of detected structural components and reconstruct missing components with high probability.  ...  There are many articles which consider the different methods and workows of the automatic detection and reconstruction of geometrical objects from point clouds.  ...  This graph is a lattice of cellular automaton, in which vertices are the automata cells.  ... 
doi:10.5194/isprs-archives-xlii-2-w3-187-2017 fatcat:4pxswhygujdt5b7efgiqawdwnu

Subject index volumes 1–200

1999 Theoretical Computer Science  
with fixed pattern problem, 129 1 subgraph isomorphic, 2027 induced -, 354 subgraph isomorphism, 1194,3478 problem, 354, 1291, 3254 subgraph isomorphism problem for classes of planar graphs  ...  , 1291 outerplanar graphs, 354 two-connected outerplanar graphs, 1291 subgraph isomorphism problem, induced -, 354 restrictions of -, 1291 subgraph maxima1 vertex-induced -, 2772 subgraph problem  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

EMERGENT 1D ISING BEHAVIOR IN AN ELEMENTARY CELLULAR AUTOMATON MODEL

PAUL G. KASSEBAUM, GERMANO S. IANNACCHIONE
2009 International Journal of Modern Physics C  
The CA simulation and new pattern recognition techniques are scalable (in both dimension, complexity, and size) and have many potential applications such as complex design of materials, control of agent  ...  Unique graphical analysis techniques are introduced through difference patterns, diffusion patterns, and state progression graphs of the 1D ensemble visualizing the evolution.  ...  Acknowledgments The authors would like to thank the Physics Department of Worcester Polytechnic Institute and the Robert Goddard Foundation for all their support.  ... 
doi:10.1142/s0129183109013510 fatcat:nhwqi7m6gff7tgctphg6o4xlku

Classification of Two Dimensional Cellular Automata Rules for Symmetric Pattern Generation

Nisha Vellarayil Mohandas, Lakshmanan Jeganathan
2018 Symmetry  
In the proposed model, the neighborhood structure in a two dimensional cellular automata (2D-CA) is viewed as a star graph.  ...  Cellular automata (CA) are parallel computational models that comprise of a grid of cells.  ...  Definition 8 (Isomorphic graph). Two graphs G 1 and G 2 are isomorphic graphs if ∃ structure preserving vertex bijection f : V(G 1 ) → V(G 2 ) . Definition 9 (Vertex bijection in a graph).  ... 
doi:10.3390/sym10120772 fatcat:44qv3sojvnagrg7pk6xp4ios6a

On the complementation of asynchronous cellular Büchi automata

Anca Muscholl
1996 Theoretical Computer Science  
We use the subset automaton construction and apply Klarlund's progress measure technique in order to complement non-deterministic asynchronous cellular Biichi automata for infinite traces.  ...  We present direct subset automata constructions for asynchronous (asynchronous cellular, resp.) automata.  ...  Acknowledgements I wish to thank Volker Diekert and Paul Gastin for interesting discussions and Wolfgang Thomas for pointing out the work of J.-P. Pecuchet.  ... 
doi:10.1016/s0304-3975(96)00117-x fatcat:74ywotnkjffs3fyybgocud4dda

Cayley automata

Max Garzon
1993 Theoretical Computer Science  
Also, the definite advantage of nondeterminism is established for Cayley automata on input graphs with at least two generators.  ...  The notion of a finite-state automaton is generalized to an automaton that scans as tapes arbitrary graphs preserving the properties of homogeneity and symmetry of ordinary Turing tapes.  ...  Schupp and David E. Muller for encouragement and useful conversations.  ... 
doi:10.1016/0304-3975(93)90231-h fatcat:u7a37cfe5jdjll2ur3vpbkepyu

Reference list of indexed articles

2000 Discrete Applied Mathematics  
Willson, Cellular automata can generate fractals 8 (1984) 9 l-99 227. J.L. Hock and R.B.  ...  Esik, A note on isomorphic simulation of automata by networks of two-state automata (Note) 30 (1991) 77-82 758. EK. Hwang and S.  ... 
doi:10.1016/s0166-218x(00)00209-2 fatcat:l53yxlj45ffdrdecl3uah2gj3y

Cumulative index of volumes 1–50

1988 Theoretical Computer Science  
KIM, Fast parallel language recognition by cellular automata IBARRA, O.H. and L.E. ROSIER, Simple programming languages and restricted classes of Turing machines IBARRA, O.H., S.K. SAHNI and C.E.  ...  SALOMAA, Isomorphism, form equivalence and sequence equivalence of PDOL forms CULIK II, K. and A. SALOMAA, On infinite words obtained by iterating morphisms CULIK II, K. and S.  ...  ROZENBERG, G. and R. VERRAEDT, On simulation and propagating EOL forms ROZENBERG, G., see 1J.J. Aalbersberg ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A.  ... 
doi:10.1016/0304-3975(88)90002-3 fatcat:gasluptczbb6bfplioxrtdrlpy

Cumulative index volumes 1–100

1992 Theoretical Computer Science  
Proskurowski, On parallel complexity of the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs 68 (2 ) ( 1989) 155-173 Linial, N. and M.  ...  Kim, Fast parallel language recognition by cellular automata 41 (2-3) (1985) 231-246 Ibarra,O.H.,seeJ.H.Chang 44 (1) (1986) 111-121 Ibarra, O.H. and T.  ... 
doi:10.1016/0304-3975(92)90292-n fatcat:ekwes6owtrco3lkfkiqagnketq

Logical definability on infinite traces

Werner Ebinger, Anca Muscholl
1996 Theoretical Computer Science  
The main results of the present paper are the equivalence of definability by monadic secondorder logic and recognizability for real trace languages, and that first-order definable, star-free, and aperiodic  ...  This generalizes results on infinite words and on finite traces to infinite traces. It closes an important gap in the different characterizations of recognizable languages of infinite traces.  ...  Kuske, and W. Thomas for many interesting comments.  ... 
doi:10.1016/0304-3975(95)00130-1 fatcat:4qsekf35zvftjbxixwoot2ie6y

Subject index volumes 101–150

1995 Theoretical Computer Science  
SO I 213, 302,402,489, 577,603,668.697 recognition 709 control 35, 49, 625, 640, 773 sets 405, 420 automata 625 tree languages 4 IS automata, finite state -625 context-freeness problems  ...  S6, 247,420, 488, 6 14, structures 38 678 features of - S3 structures, category of r~ 38 subsystems 628 subclass of - 678 time 628 context-free variables 628 graphs 1, 32, 69 continuous-state  ... 
doi:10.1016/0304-3975(95)80002-6 fatcat:azbu2orp7vc75pwux4jxnvxl7m

Topological transformations as a tool in the design of systolic networks

Karel Culik, Ivan Fris
1985 Theoretical Computer Science  
For example, we use the transformation technique to give a concise proof of a strengthened version of Leiserson's and Saxe's Retiming Lemma and Systolic Conversion Theorem.  ...  Our basic and very useful tools are topological transformations of the space-time diagrams (unrollings) of computations on CN.  ...  the proof of [28, Theorem 6.3] it is also implicitly assumed that all the processors of the shuffle-exchange network have memory; however in [28, Fig. 6 .1 ] the selfloops are shown for the leftmost and  ... 
doi:10.1016/0304-3975(85)90091-x fatcat:miga4mm5z5dp5gm7wltdwqfjbm

Reference list of indexed articles

1999 Theoretical Computer Science  
Hartmanis, A note on natural complete sets and Godel numberings 17 (1) (1982) 75-89 354. M.M. Syslo, The subgraph isomorphism problem for outerplanar graphs 17 (1) (1982) 91-97 355. M.  ...  Heilbrunner, A parsing automata approach to LR theory 15 (2) (1981) 117-157 314. G. Schmidt, Programs as partial graphs II: Recursion 15 (2) (1981) 159-179 315. L.H. Landweber, R.J. Lipton and E.L.  ... 
doi:10.1016/s0304-3975(98)00320-x fatcat:bdgg2ekzdjahdo7g2gtwbdye6m
« Previous Showing results 1 — 15 out of 80 results