The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Automata-based representations for infinite graphs

Salvatore La Torre; Margherita Napoli

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2001)

  • Volume: 35, Issue: 4, page 311-330
  • ISSN: 0988-3754

Abstract

top
New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns its suffix and the last one returns its infixes. The first-difference function is substantially a direct generalization to infinite multi-hyper-graphs of the representation introduced by Ehrenfeucht et al. for finite graphs. This representation, though very interesting for finite graphs, turns out to be quite unsatisfactory for infinite graphs. The other two functions we consider while preserving some interesting features of their representation also achieves a high expressive power. As a matter of fact, our formalism either with the suffix or infix function results to be more powerful than the equational graphs introduced by Courcelle and the simple graphs defined by Caucal. The monadic second order theories of these two classes of graphs are undecidable, but still many interesting graph properties are decidable. The use of a regular prefix-free language to represent the vertices allows (fixed the language of the edges) to express a graph by a labelled tree, moreover, the use of finite automata to represent the edges allows the verification of graph properties.

How to cite

top

Torre, Salvatore La, and Napoli, Margherita. "Automata-based representations for infinite graphs." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 35.4 (2001): 311-330. <http://eudml.org/doc/92668>.

@article{Torre2001,
abstract = {New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns its suffix and the last one returns its infixes. The first-difference function is substantially a direct generalization to infinite multi-hyper-graphs of the representation introduced by Ehrenfeucht et al. for finite graphs. This representation, though very interesting for finite graphs, turns out to be quite unsatisfactory for infinite graphs. The other two functions we consider while preserving some interesting features of their representation also achieves a high expressive power. As a matter of fact, our formalism either with the suffix or infix function results to be more powerful than the equational graphs introduced by Courcelle and the simple graphs defined by Caucal. The monadic second order theories of these two classes of graphs are undecidable, but still many interesting graph properties are decidable. The use of a regular prefix-free language to represent the vertices allows (fixed the language of the edges) to express a graph by a labelled tree, moreover, the use of finite automata to represent the edges allows the verification of graph properties.},
author = {Torre, Salvatore La, Napoli, Margherita},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {infinite graphs; formal languages; representation of infinite graphs; finite automata; equational graphs; graph classes},
language = {eng},
number = {4},
pages = {311-330},
publisher = {EDP-Sciences},
title = {Automata-based representations for infinite graphs},
url = {http://eudml.org/doc/92668},
volume = {35},
year = {2001},
}

TY - JOUR
AU - Torre, Salvatore La
AU - Napoli, Margherita
TI - Automata-based representations for infinite graphs
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2001
PB - EDP-Sciences
VL - 35
IS - 4
SP - 311
EP - 330
AB - New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns its suffix and the last one returns its infixes. The first-difference function is substantially a direct generalization to infinite multi-hyper-graphs of the representation introduced by Ehrenfeucht et al. for finite graphs. This representation, though very interesting for finite graphs, turns out to be quite unsatisfactory for infinite graphs. The other two functions we consider while preserving some interesting features of their representation also achieves a high expressive power. As a matter of fact, our formalism either with the suffix or infix function results to be more powerful than the equational graphs introduced by Courcelle and the simple graphs defined by Caucal. The monadic second order theories of these two classes of graphs are undecidable, but still many interesting graph properties are decidable. The use of a regular prefix-free language to represent the vertices allows (fixed the language of the edges) to express a graph by a labelled tree, moreover, the use of finite automata to represent the edges allows the verification of graph properties.
LA - eng
KW - infinite graphs; formal languages; representation of infinite graphs; finite automata; equational graphs; graph classes
UR - http://eudml.org/doc/92668
ER -

References

top
  1. [1] S. Arnborg, J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs. J. Algorithms 12 (1991) 308-340. Zbl0734.68073MR1105479
  2. [2] K. Barthelmann, When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?, in Proc. of the 23th International Symposium on Mathematical Foundations of Computer Science (MFCS’98), edited by L. Brim, J. Gruska and J. Zlatuska. Brno, Czech Republic, August 24-28, 1998, Lecture Notes in Comput. Sci. 1450 (1998) 543-552. Zbl0917.05054
  3. [3] M. Bauderon and B. Courcelle, Graph Expressions and Graph Rewritings. Math. Systems Theory 20 (1987) 83-127. Zbl0641.68115MR920770
  4. [4] H. L. Bodlaender and R. H. Möhring, The pathwidth and treewidth of cographs. SIAM J. Discrete Math. 6 (1993) 181-188. Zbl0773.05091MR1215226
  5. [5] D. Caucal, On infinite transition graphs having a decidable monadic theory, in Proc. of 23rd International Colloquium on Automata, Languages and Programming (ICALP’96), edited by F.M. auf der Heide and B. Monien. Paderborn, Germany, July 8-12, 1996, Lecture Notes in Comput. Sci. 1099 (1996) 194-205. Zbl1045.03509
  6. [6] D.G. Corneil, H. Lerchs and L. Stuart Burlingham, Complement reducible graphs. Discrete Appl. Math. 3 (1981) 163-174. Zbl0463.05057MR619603
  7. [7] B. Courcelle, The monadic second-order logic of graphs. II. Infinite graphs of bounded width. Mathematical Systems Theory 21 (1989) 187-221. Zbl0694.68043MR987150
  8. [8] B. Courcelle, The monadic second-order logic of graphs. III. Tree-width, forbidden minors and complexity issues. RAIRO: Theoret. Informatics Appl. 26 (1992) 257-286. Zbl0754.03006MR1170326
  9. [9] A. Ehrenfeucht, J. Engelfriet and G. Rozenberg, Finite Languages for the Representation of Finite Graphs. J. Comput. System Sci. 52 (1996) 170-184. Zbl0846.68080MR1375812
  10. [10] J. Engelfriet, T. Harju, A. Proskurowski and G. Rozenberg, Characterization and Complexity of Uniformly Non-primitive Labeled 2-Structures. Theoretical Comput. Sci. 154 (1996) 247-282. Zbl0873.68161MR1369531
  11. [11] P.C. Fisher, Multi-Tape and Infinite-State Automata – A Survey. Comm. ACM 8 (1965) 799-805. Zbl0129.00503
  12. [12] J. Hopcroft and J. Ullman, Introduction to Automata Theory, Formal Languages and Computation. Addison-Wesley Publishing Company, Addison-Wesley Series in Comput. Sci.(1979) Zbl0426.68001MR645539
  13. [13] S. La Torre and M. Napoli, Representing Hyper-Graphs by Regular Languages. in Proc. of the 23th International Symposium on Mathematical Foundations of Computer Science (MFCS’98), edited by L. Brim, J. Gruska and J. Zlatuska, Brno, Czech Republic, August 24-28, 1998, Lecture Notes in Comput. Sci. 1450 (1998) 571-579. Zbl0915.05092
  14. [14] C. Morvan, On Rational Graphs, in Proc. of the 3rd International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2000). Berlin, Germany, March 25 - April 2, 2000, Lecture Notes in Comput. Sci. 1784 (2000) 252-266. Zbl0961.68107MR1798632
  15. [15] N. Robertson and P. Seymour, Graph Minors. II Algorithmic aspects of tree-width. J. Algorithms 7 (1986) 309-322. Zbl0611.05017MR855559
  16. [16] J. Valdez, R. E. Tarjan and E. Lawler, The recognition of series parallel digraphs. SIAM J. Comput. 11 (1982) 298-313. Zbl0478.68065MR652904

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.