Relevant bibliographies by topics / Graph theory. Formal languages

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Graph theory. Formal languages'

Author: Grafiati
Published: 4 June 2021
Last updated: 19 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph theory. Formal languages.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graph theory. Formal languages"

1

Çevik, Ahmet. "Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties." International Journal of Foundations of Computer Science 31, no. 04 (June 2020): 483–98. http://dx.doi.org/10.1142/s0129054120500203.

Full text
Abstract:
We bring into attention the interplay between model theory of committed graphs (1-regular graphs) and their palindromic characteristic in the domain of formal languages. We prove some model theoretic properties of committed graphs and then give a characterization of them in the formal language domain using palindromes. We show in the first part of the paper that the theory of committed graphs and the theory of infinite committed graphs differ in terms of completeness. We give the observation that theories of finite and infinite committed graphs are both decidable. The former is finitely axiomatizable, whereas the latter is not. We note that every committed graph is isomorphic to the structure of integers. In the second part, as our main focus of the paper and using some of the results in the first section, we give a characterization of committed graphs based on the notion of finite and infinite palindrome strings.
APA, Harvard, Vancouver, ISO, and other styles
2

BONIFATI, ANGELA, STEFANIA DUMBRAVA, and EMILIO JESÚS GALLEGO ARIAS. "Certified Graph View Maintenance with Regular Datalog." Theory and Practice of Logic Programming 18, no. 3-4 (July 2018): 372–89. http://dx.doi.org/10.1017/s1471068418000224.

Full text
Abstract:
AbstractWe employ the Coq proof assistant to develop a mechanically-certified framework for evaluating graph queries and incrementally maintaining materialized graph instances, also called views. The language we use for defining queries and views is Regular Datalog (RD) – a notable fragment of non-recursive Datalog that can express complex navigational queries, with transitive closure as native operator. We first design and encode the theory of RD and then mechanize a RD-specific evaluation algorithm capable of fine-grained, incremental graph view computation, which we prove sound with respect to the declarative RD semantics. By using the Coq extraction mechanism, we test an OCaml version of the verified engine on a set of preliminary benchmarks. Our development is particularly focused on leveraging existing verification and notational techniques to: a) define mechanized properties that can be easily understood by logicians and database researchers and b) attain formal verification with limited effort. Our work is the first step towards a unified, machine-verified, formal framework for dynamic graph query languages and their evaluation engines.
APA, Harvard, Vancouver, ISO, and other styles
3

ECHAHED, RACHID. "Foreword: special issue on term and graph rewriting." Mathematical Structures in Computer Science 28, no. 8 (July 6, 2018): 1287–89. http://dx.doi.org/10.1017/s0960129518000191.

Full text
Abstract:
Rewriting techniques constitute a foundational theory of computing science. They are being investigated for several structures, such as lambda-terms, strings, first-order terms or graphs, and have been successfully used in many areas such as programming languages, automated reasoning, program verification, security, etc. The growing interest in this research area is witnessed by the leading international events, such as ICGT (International Conference on Graph Transformation) and the recent FSCD conference (International Conference on Formal Structures for Computation and Deduction), which gathers all topics of the former international conferences RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications). During the last decade, a particular interest has been devoted to the study of the impact of shared structures in term and graph rewriting through the international workshops editions of TERMGRAPH and GCM (Graph Computation Models).
APA, Harvard, Vancouver, ISO, and other styles
4

Lavrischeva, E. M. "The Theory Graph Modeling and Programming Systems from Module Elements to the Application Areas." Computer and Information Science 12, no. 4 (September 24, 2019): 20. http://dx.doi.org/10.5539/cis.v12n4p20.

Full text
Abstract:
The mathematical basics of graph modeling and paradigm programming of applied systems (AS) are presented. The vertices of graph are been the functional elements of the systems and the arcs define the connections between them. The graph is represented by an adjacency and reach ability matrix. A number of graph of program structures and their representation by mathematical operations (unions, connections, differences, etc.) are shown. Given the characteristics of graph structures, complexes, units, and systems created from the modules of the graph. The method of modeling the system on the graph of modules, which describe in the programming languages (LP) and calling them with operations (link, assembling, building, etc.). The standard of configuration (2012) Assembly of heterogeneous software elements in AS of different fields of knowledge is made. Brief descriptions of modern and future programming paradigms for formal theoretical creation of systems from service-components for Internet in the near future are given.
APA, Harvard, Vancouver, ISO, and other styles
5

Kuhlmann, Marco, and Stephan Oepen. "Towards a Catalogue of Linguistic Graph Banks." Computational Linguistics 42, no. 4 (December 2016): 819–27. http://dx.doi.org/10.1162/coli_a_00268.

Full text
Abstract:
Graphs exceeding the formal complexity of rooted trees are of growing relevance to much NLP research. Although formally well understood in graph theory, there is substantial variation in the types of linguistic graphs, as well as in the interpretation of various structural properties. To provide a common terminology and transparent statistics across different collections of graphs in NLP, we propose to establish a shared community resource with an open-source reference implementation for common statistics.
APA, Harvard, Vancouver, ISO, and other styles
6

Saberifar, Fatemeh Zahra, Shervin Ghasemlou, Dylan A. Shell, and Jason M. O’Kane. "Toward a language-theoretic foundation for planning and filtering." International Journal of Robotics Research 38, no. 2-3 (September 29, 2018): 236–59. http://dx.doi.org/10.1177/0278364918801503.

Full text
Abstract:
We address problems underlying the algorithmic question of automating the co-design of robot hardware in tandem with its apposite software. Specifically, we consider the impact that degradations of a robot’s sensor and actuation suites may have on the ability of that robot to complete its tasks. We introduce a new formal structure that generalizes and consolidates a variety of well-known structures including many forms of plans, planning problems, and filters, into a single data structure called a procrustean graph, and give these graph structures semantics in terms of ideas based in formal language theory. We describe a collection of operations on procrustean graphs (both semantics-preserving and semantics-mutating), and show how a family of questions about the destructiveness of a change to the robot hardware can be answered by applying these operations. We also highlight the connections between this new approach and existing threads of research, including combinatorial filtering, Erdmann’s strategy complexes, and hybrid automata.
APA, Harvard, Vancouver, ISO, and other styles
7

Wilks, Clarissa, and Paul Meara. "Untangling word webs: graph theory and the notion of density in second language word association networks." Second Language Research 18, no. 4 (October 2002): 303–24. http://dx.doi.org/10.1191/0267658302sr203oa.

Full text
Abstract:
This article examines the implications of the metaphor of the ‘vocabulary network’. It takes a formal approach to the exploration of this metaphor by applying the principles of Graph Theory to word association data in order to compare the relative densities of first language (L1) and second language (L2) lexical networks. Earlier graph theoretical research into L2 word associations is reviewed and methodological flaws in this work discussed. It describes the development of a new elicitation tool which is able to provide a means of quantifying lexical density levels. Levels of linkage in the L1 and L2 lexical networks are shown to be higher than previously assumed in the literature. It is argued that it will be helpful to develop a more complex interpretation of the notion of lexical density.
APA, Harvard, Vancouver, ISO, and other styles
8

Ovsyak, V. K., O. V. Ovsyak, and J. V. Petruszka. "ORDER AND ORDERING IN DISCRETE MATHEMATICS AND INFORMATICS." Ukrainian Journal of Information Technology 3, no. 1 (2021): 37–43. http://dx.doi.org/10.23939/ujit2021.03.037.

Full text
Abstract:
The available means of ordering and sorting in some important sections of discrete mathematics and computer science are studied, namely: in the set theory, classical mathematical logic, proof theory, graph theory, POST method, system of algorithmic algebras, algorithmic languages of object-oriented and assembly programming. The Cartesian product of sets, ordered pairs and ordered n-s, the description by means of set theory of an ordered pair, which are performed by Wiener, Hausdorff and Kuratowski, are presented. The requirements as for the relations that order sets are described. The importance of ordering in classical mathematical logic and proof theory is illustrated by the examples of calculations of the truth values of logical formulas and formal derivation of a formula on the basis of inference rules and substitution rules. Ordering in graph theory is shown by the example of a block diagram of the Euclidean algorithm, designed to find the greatest common divisor of two natural numbers. The ordering and sorting of both the instructions formed by two, three and four ordered fields and the existing ordering of instructions in the program of Post method are described. It is shown that the program is formed by the numbered instructions with unique instruction numbers and the presence of the single instruction with number 1. The means of the system of algorithmic algebras, which are used to perform the ordering and sorting in the algorithm theory, are illustrated. The operations of the system of algorithmic algebras are presented, which include Boolean algebra operations generalized to the three-digit alphabet and operator operations of operator algebra. The properties of the composition operation are described, which is intended to describe the orderings of the operators of the operator algebra in the system of algorithmic algebras. The orderings executed by means of algorithmic programming languages are demonstrated by the hypothetical application of the modern object-oriented programming language C#. The program must contain only one method Main () from which the program execution begins. The ARM microprocessor assembly program must have only one ENTRY directive from which the program execution begins.
APA, Harvard, Vancouver, ISO, and other styles
9

Paramasivan, Meenakshi, and N. G. David. "Shuffle Operations on Euler Graphs." Mapana - Journal of Sciences 10, no. 1 (June 30, 2011): 63–78. http://dx.doi.org/10.12723/mjs.18.6.

Full text
Abstract:
The shuffle operation on strings is a fundamental operation, well studied in the theory of formal languages. Shuffle on trajectories yields a flexible method to handle the shuffle operation on two strings. In this paper, the shuffle on trajectories is extended to the string representations of Euler graphs and interesting results are obtained. Some algebraic properties such as completeness, determinism and commutativity of the trajectories involved in this study are provided.
APA, Harvard, Vancouver, ISO, and other styles
10

Razborov, Alexander A. "Flag algebras." Journal of Symbolic Logic 72, no. 4 (December 2007): 1239–82. http://dx.doi.org/10.2178/jsl/1203350785.

Full text
Abstract:
AbstractAsymptotic extremal combinatorics deals with questions that in the language of model theory can be re-stated as follows. For finite models M, N of an universal theory without constants and function symbols (like graphs, digraphs or hypergraphs), let p(M, N) be the probability that a randomly chosen sub-model of N with ∣M∣ elements is isomorphic to M. Which asymptotic relations exist between the quantities p(M1,N),…, p(Mh,N), where M1,…, M1, are fixed “template” models and ∣N∣ grows to infinity?In this paper we develop a formal calculus that captures many standard arguments in the area, both previously known and apparently new. We give the first application of this formalism by presenting a new simple proof of a result by Fisher about the minimal possible density of triangles in a graph with given edge density.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Graph theory. Formal languages"

1

Reutter, Juan L. "Graph patterns : structure, query answering and applications in schema mappings and formal language theory." Thesis, University of Edinburgh, 2013. http://hdl.handle.net/1842/8931.

Full text
Abstract:
Graph data appears in a variety of application domains, and many uses of it, such as querying, matching, and transforming data, naturally result in incompletely specified graph data, i.e., graph patterns. Queries need to be posed against such data, but techniques for querying patterns are generally lacking, and even simple properties of graph patterns, such as the languages needed to specify them, are not well understood. In this dissertation we present several contributions in the study of graph patterns. We analyze how to query them and how to use them as queries. We also analyze some of their applications in two different contexts: schema mapping specification and data exchange for graph databases, and formal language theory. We first identify key features of patterns, such as node and label variables and edges specified by regular expressions, and define a classification of patterns based on them. Next we study how to answer standard graph queries over graph patterns, and give precise characterizations of both data and combined complexity for each class of patterns. If complexity is high, we do further analysis of features that lead to intractability, as well as lower-complexity restrictions that guarantee tractability. We then turn to the the study of schema mappings for graph databases. As for relational and XML databases, our mapping languages are based on patterns. They subsume all previously considered mapping languages for graph databases, and are capable of expressing many data exchange scenarios in the graph database context. We study the problems of materializing solutions and query answering for data exchange under these mappings, analyze their complexity, and identify relevant classes of mappings and queries for which these problems can be solved efficiently. We also introduce a new model of automata that is based on graph patterns, and define two modes of acceptance for them. We show that this model has applications not only in graph databases but in several other contexts. We study the basic properties of such automata, and the key computational tasks associated with them.
APA, Harvard, Vancouver, ISO, and other styles
2

Dorman, Andrei. "Concurrency in Interaction Nets and Graph Rewriting." Phd thesis, Université Paris-Nord - Paris XIII, 2013. http://tel.archives-ouvertes.fr/tel-00937224.

Full text
Abstract:
Ce travail est une étude approfondie de la concurrence dans les extensions non-déterministes des réseaux d'interaction de Lafont (langage graphique qui représente, lui, le calcul fonctionnel). Ces extensions sont de trois sortes : les réseaux multirègles, multiports et multifils, et leurs combinaisons donnent ainsi sept types de réseaux. Un premier travail consiste à déterminer une bonne sémantique pour pouvoir comparer ces extensions. On cherche à définir un sémantique opérationnelle structurelle sur les réseaux en se basant sur des technique connues de réécriture des graphes, plus particulièrement celle de " double-pushout with borrowed contexts ". Nous définissons à partir de cette méthode un système d'étiquetage des transitions donné par des règles de dérivations dans le style des langages de processus qui sont le paradigme principal pour étudier les systèmes de calcul concurrents. Nous définissons de plus une sémantique observationnelle sur les réseaux basée sur une notion paramétrique de barbe, qui permet enfin de donner avec précision une notion de traduction entre systèmes. On considère qu'une extension est plus expressive qu'une autre si tout langage de la seconde peut être traduit dans un langage de la première. Ceci nous permet de classer l'ensemble des extensions de manière hiérarchique en trois groupe selon la possibilité de traduire un système de réseau dans un autre. Du plus fort au plus faible : les réseaux contenant des multiports ; ensuite ceux contenant des multifils; enfin les réseaux multirègles. Ceci nous permet de donner un langage universel pour les réseaux dont l'étude donne un point de vue neuf sur les briques fondamentales de la concurrence.
APA, Harvard, Vancouver, ISO, and other styles
3

Kwon, Ky-Sang. "Multi-layer syntactical model transformation for model based systems engineering." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42835.

Full text
Abstract:
This dissertation develops a new model transformation approach that supports engineering model integration, which is essential to support contemporary interdisciplinary system design processes. We extend traditional model transformation, which has been primarily used for software engineering, to enable model-based systems engineering (MBSE) so that the model transformation can handle more general engineering models. We identify two issues that arise when applying the traditional model transformation to general engineering modeling domains. The first is instance data integration: the traditional model transformation theory does not deal with instance data, which is essential for executing engineering models in engineering tools. The second is syntactical inconsistency: various engineering tools represent engineering models in a proprietary syntax. However, the traditional model transformation cannot handle this syntactic diversity. In order to address these two issues, we propose a new multi-layer syntactical model transformation approach. For the instance integration issue, this approach generates model transformation rules for instance data from the result of a model transformation that is developed for user model integration, which is the normal purpose of traditional model transformation. For the syntactical inconsistency issue, we introduce the concept of the complete meta-model for defining how to represent a model syntactically as well as semantically. Our approach addresses the syntactical inconsistency issue by generating necessary complete meta-models using a special type of model transformation.
APA, Harvard, Vancouver, ISO, and other styles
4

Ngô, Van Chan. "Formal verification of a synchronous data-flow compiler : from Signal to C." Phd thesis, Université Rennes 1, 2014. http://tel.archives-ouvertes.fr/tel-01067477.

Full text
Abstract:
Synchronous languages such as Signal, Lustre and Esterel are dedicated to designing safety-critical systems. Their compilers are large and complicated programs that may be incorrect in some contexts, which might produce silently bad compiled code when compiling source programs. The bad compiled code can invalidate the safety properties that are guaranteed on the source programs by applying formal methods. Adopting the translation validation approach, this thesis aims at formally proving the correctness of the highly optimizing and industrial Signal compiler. The correctness proof represents both source program and compiled code in a common semantic framework, then formalizes a relation between the source program and its compiled code to express that the semantics of the source program are preserved in the compiled code.
APA, Harvard, Vancouver, ISO, and other styles
5

Diener, Glendon. "Formal languages in music theory." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59610.

Full text
Abstract:
In this paper, the mathematical theory of languages is used to investigate and develop computer systems for music analysis, composition, and performance. Four prominent research projects in the field are critically reviewed. An original grammar-type for the computer representation of music is introduced, and a computer system for music composition and performance based on that grammar is described. A user's manual for the system is provided as an appendix.
APA, Harvard, Vancouver, ISO, and other styles
6

Duboc, Christine. "Commutations dans les monoïdes libres : un cadre théorique pour l'étude du parallélisme." Rouen, 1986. http://www.theses.fr/1986ROUES003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sezinando, Helena Maria da Encarnação. "Formal languages and idempotent semigroups." Thesis, University of St Andrews, 1991. http://hdl.handle.net/10023/13724.

Full text
Abstract:
The structure of the lattice LB of varieties of idempotent semigroups or bands (as universal algebras) was determined by Birjukov, Fennemore and Gerhard. Wis- math determined the structure of a related lattice: the lattice LBM of varieties of band monoids. In the first two parts we study several questions about these varieties. In Part I we compute the cardinalities of the Green classes of the free objects in each variety of LB [LBM]. These cardinalities constitute a useful piece of information in the study of several questions about these varieties and some of the conclusions obtained here are used in parts II and III. Part II concerns expansions of bands [band monoids]. More precisely, we compute here the cut-down to generators of the Rhodes expansions of the free objects in the varieties of LB. We define Rhodes expansion of a monoid, its cut-down to generators and we compute the cut-down to generators of the Rhodes expansions of the free objects in the varieties of LBM. In Part III we deal with Eilenberg varieties of band monoids. The last chapter is particularly concerned with the description of the varieties of languages corresponding to these varieties.
APA, Harvard, Vancouver, ISO, and other styles
8

Emerson, Guy Edward Toh. "Functional distributional semantics : learning linguistically informed representations from a precisely annotated corpus." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/284882.

Full text
Abstract:
The aim of distributional semantics is to design computational techniques that can automatically learn the meanings of words from a body of text. The twin challenges are: how do we represent meaning, and how do we learn these representations? The current state of the art is to represent meanings as vectors - but vectors do not correspond to any traditional notion of meaning. In particular, there is no way to talk about 'truth', a crucial concept in logic and formal semantics. In this thesis, I develop a framework for distributional semantics which answers this challenge. The meaning of a word is not represented as a vector, but as a 'function', mapping entities (objects in the world) to probabilities of truth (the probability that the word is true of the entity). Such a function can be interpreted both in the machine learning sense of a classifier, and in the formal semantic sense of a truth-conditional function. This simultaneously allows both the use of machine learning techniques to exploit large datasets, and also the use of formal semantic techniques to manipulate the learnt representations. I define a probabilistic graphical model, which incorporates a probabilistic generalisation of model theory (allowing a strong connection with formal semantics), and which generates semantic dependency graphs (allowing it to be trained on a corpus). This graphical model provides a natural way to model logical inference, semantic composition, and context-dependent meanings, where Bayesian inference plays a crucial role. I demonstrate the feasibility of this approach by training a model on WikiWoods, a parsed version of the English Wikipedia, and evaluating it on three tasks. The results indicate that the model can learn information not captured by vector space models.
APA, Harvard, Vancouver, ISO, and other styles
9

Akkara, Pinto. "Applying DNA Self-assembly in Formal Language Theory." University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1368014016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Taha, Mohamed A. M. S. "Regulated rewriting in formal language theory." Thesis, Link to the online version, 2008. http://hdl.handle.net/10019/910.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Graph theory. Formal languages"

1

Schürr, Andreas. Operationales Spezifizieren mit programmierten Graphersetzungssystemen: Formale Definitionen, Anwendungsbeispiele und Werkzeugunterstützung. Wiesbaden: DUV, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Morselli, Carlo. Inside criminal networks. New York: Springer Science+Business Media, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Formal languages and automata theory. Oxford [UK]: Oxford University Press, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gregor, Engels, Kreowski Hans-Jörg, Rozenberg Grzegorz, and SpringerLink (Online service), eds. Graph Transformations: 6th International Conference, ICGT 2012, Bremen, Germany, September 24-29, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Moll, Robert N. An introduction to formal language theory. New York: Springer-Verlag, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

A, Arbib Michael, and Kfoury A. J, eds. An introduction to formal language theory. New York: Springer-Verlag, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

NATO Advanced Study Institute on Semigroups, Formal Languages, and Groups (1993 University of York). Semigroups, formal languages, and groups. Dordrecht: Kcluwer Academic Publishers, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Inc, ebrary, ed. Theory of automata, formal languages and computation. New Delhi: New Age International (P) Ltd., Publishers, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sebastian, Rudolph, Wilson Nic, Howse John, Corby Olivier, and SpringerLink (Online service), eds. Graph Structures for Knowledge Representation and Reasoning: Second International Workshop, GKR 2011, Barcelona, Spain, July 16, 2011. Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

ItÕo, Masami. Algebraic theory of automata and languages. Singapore: World Scientific, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Graph theory. Formal languages"

1

Engelfriet, Joost. "Context-Free Graph Grammars." In Handbook of Formal Languages, 125–213. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59126-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bell, Paul C., Daniel Reidenbach, and Jeffrey Shallit. "Factorization in Formal Languages." In Developments in Language Theory, 97–107. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21500-6_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Moore, J. Strother. "An Exercise in Graph Theory." In Advances in Formal Methods, 41–74. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-3188-0_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mateescu, Alexandru, and Arto Salomaa. "Aspects of Classical Language Theory." In Handbook of Formal Languages, 175–251. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59136-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Baeza-Yates, Ricardo, and Gonzalo Navarro. "Text Searching: Theory and Practice." In Formal Languages and Applications, 565–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-39886-8_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Niemi, Valtteri. "Cryptography: Basic Theory and Practice." In Formal Languages and Applications, 599–620. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-39886-8_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Blazy, Sandrine, Benoît Robillard, and Andrew W. Appel. "Formal Verification of Coalescing Graph-Coloring Register Allocation." In Programming Languages and Systems, 145–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11957-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Holzer, Markus, and Muriel Quenzer. "VisA: A Tool for Visualizing and Animating Automata and Formal Languages." In Graph Drawing, 450–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-37623-2_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Domaratzki, Michael, Jeffrey Shallit, and Sheng Yu. "Minimal Covers of Formal Languages." In Developments in Language Theory, 319–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46011-x_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shallit, Jeffrey. "Formal languages and number theory." In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 169–81. Providence, Rhode Island: American Mathematical Society, 2004. http://dx.doi.org/10.1090/dimacs/064/15.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph theory. Formal languages"

1

Schopper, Dominik, and Stephan Rudolph. "From Model-Driven Architecture and Model-Based Systems Engineering via Formal Concept Analysis to Graph-Based Design Languages and Back: A Scientific Discourse." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-86392.

Full text
Abstract:
Most modern digital approaches to engineering are based on models and their model transformations. Most of these model transformations are mathematically speaking non-bijective mappings — so-called projections — where some information of the original model is lost during the mapping. From a theoretical point of view it is therefore of great interest to exactly examine the properties of these model transformations. In this paper at first the characteristics of a model are briefly explained. Then some of the most common model-based engineering approaches are reviewed and compared regarding their models and model transformations. In this examination the missing existence of an inverse transformation (a so-called text-to-model transformation, T2M) of a typical model transformation (a so-called model-to-text transformation, M2T) is identified. That discovery may well hold the key to the realization of a so-called round-trip engineering. The required existence of the inverse transformation to this round-trip engineering is then generically postulated as having the nature of a pattern recognition problem. For illustration purposes and a better understanding of the interpretation of the inverse transformation as a pattern recognition problem, a case study for the reconstruction of an abstract model from the concrete model is given using CAD-Data of a satellite. Since CAD models belong to geometry, dimensionless geometric moment invariants play a key role in the generic solution of the pattern recognition problem contained in this example.
APA, Harvard, Vancouver, ISO, and other styles
2

Hurst, Terril N. "Automated Model Generation Using the KIF Declarative Language." In ASME 1991 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/cie1991-0018.

Full text
Abstract:
Abstract Logic-based artificial intelligence researchers propound the declarative programming paradigm as a solution to problems arising from conventional procedural programming methods. A formal language possessing a declarative semantics, called Knowledge Interchange Format (or KIF), has been used for interchanging information between disparate programs, each containing specialized internal representations to support specific requirements. A simple system has been developed to evaluate the utility of KIF and declarative programming. The domain chosen for this evaluation was lumped-parameter dynamic systems analysis, due to its well-established vocabulary and concepts. In particular, bond graph theory formed the basis of the knowledge representation which was written in KIF. Models were generated to analyze the physical dynamics of a servomechanism used in a compact disc player. Fully automated model construction and solution was achieved, beginning with a set of library elements written in KIF and ending with solution of a set of first-order differential equations which characterize dynamic behavior. Work has begun to include assembly as well as bond graph information in order to evaluate the system’s utility for managing constraints in multiple domains. Based on demonstrated success in the dynamics and assembly domains, the next step will be to apply declarative programming to more-open domains, such as functional tolerancing, for which a comprehensive vocabulary and conceptual framework is still lacking. The hope is that the declarative paradigm will contribute to the formalization of several domains which can then be more easily integrated within a concurrent engineering environment, thus fostering conceptual product designs which are more robust with respect to manufacturability constraints.
APA, Harvard, Vancouver, ISO, and other styles
3

Kang, SungKu, Lalit Patil, Arvind Rangarajan, Abha Moitra, Tao Jia, Dean Robinson, and Debasish Dutta. "Extraction of Manufacturing Rules From Unstructured Text Using a Semantic Framework." In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-47556.

Full text
Abstract:
Formal ontology and rule-based approaches founded on semantic technologies have been proposed as powerful mechanisms to enable early manufacturability feedback. A fundamental unresolved problem in this context is that all manufacturing knowledge is encoded in unstructured text and there are no reliable methods to automatically convert it to formal ontologies and rules. It is impractical for engineers to write accurate domain rules in a structured semantic languages such as Web Ontology Language (OWL) or Semantic Application Design Language (SADL). Previous efforts in manufacturing research that have targeted extraction of OWL ontologies from text have focused on basic concept names and hierarchies. This paper presents a semantics-based framework for acquiring more complex manufacturing knowledge, primarily rules, in a semantically-usable form from unstructured English text such as those written in manufacturing handbooks. The approach starts with existing domain knowledge in the form of OWL ontologies and applies natural language processing techniques to extract dependencies between different words in the text that contains the rule. Domain-specific triples capturing each rule are then extracted from each dependency graph. Finally, new computer-interpretable rules are composed from the triples. The feasibility of the framework has been evaluated by automatically and accurately generating rules for manufacturability from a manufacturing handbook. The paper also documents the cases that result in ambiguous results. Analysis of the results shows that the proposed framework can be extended to extract domain ontologies which forms part of the ongoing work that also focuses on addressing challenges to automate different steps and improve the reliability of the system.
APA, Harvard, Vancouver, ISO, and other styles
4

de Souza, Gabriel Spadon, Celso Olivete, Ronaldo Celso Messias Correia, and Rogerio Eduardo Garcia. "Teaching-learning methodology for formal languages and automata theory." In 2015 IEEE Frontiers in Education Conference (FIE). IEEE, 2015. http://dx.doi.org/10.1109/fie.2015.7344185.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gopalani, Dinesh, and M. C. Govil. "Untyped Aspect Calculus : Formal theory of aspect-oriented programming languages." In 2010 IEEE 2nd International Advance Computing Conference (IACC 2010). IEEE, 2010. http://dx.doi.org/10.1109/iadcc.2010.5423012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rabuzin, Kornelije, Sonja Ristić, and Robert Kudelić. "GRAPH DATABASE MANAGEMENT SYSTEMS AND GRAPH THEORY." In Fourth International Scientific Conference ITEMA Recent Advances in Information Technology, Tourism, Economics, Management and Agriculture. Association of Economists and Managers of the Balkans, Belgrade, Serbia, 2020. http://dx.doi.org/10.31410/itema.2020.39.

Full text
Abstract:
In recent years, graph databases have become far more important. They have been proven to be an excellent choice for storing and managing large amounts of interconnected data. Since graph databases (GDB) rely on a graph data model based on graph theory, this study examines whether currently available graph database management systems support the principles of graph theory, and, if so, to what extent. We also show how these systems differ in terms of implementation and languages, and we also discuss which graph database management systems are used today and why.
APA, Harvard, Vancouver, ISO, and other styles
7

Nothen, Eric, and Lic Maria de Fatima Mastroianni. "Data structures, from theory to bits: Using theory of formal languages to analyze structured data." In 2016 IEEE Congreso Argentino de Ciencias de la Informática y Desarrollos de Investigación (CACIDI). IEEE, 2016. http://dx.doi.org/10.1109/cacidi.2016.7785981.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rafeh, V. "Formal verification of attributed and typed graph transformation systems." In 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icacte.2010.5579448.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chesñevar, Carlos I., Maria P. González, and Ana G. Maguitman. "Didactic strategies for promoting significant learning in formal languages and automata theory." In the 9th annual SIGCSE conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1007996.1008002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Vijayalaskhmi, M., and K. G. Karibasappa. "Activity based teaching learning in formal languages and automata theory - An experience." In 2012 IEEE International Conference on Engineering Education: Innovative Practices and Future Trends (AICERA). IEEE, 2012. http://dx.doi.org/10.1109/aicera.2012.6306722.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graph theory. Formal languages"

1

Hoinkes, Ulrich. Indexicality and Enregisterment as Theoretical Approaches to the Sociolinguistic Analysis of Romance Languages. Universitatsbibliothek Kiel, November 2019. http://dx.doi.org/10.21941/hoinkesindexenregromlang.

Full text
Abstract:
Social indexicality and enregisterment are basic notions of a theoretical model elaborated in the United States, the aim of which is to describe the relationship between the use of language variation and patterns of social behavior at the level of formal classification. This analytical approach is characterized by focusing on the interrelation of social performance and language awareness. In my contribution, I want to show how this modern methodology can give new impetus to the study of today’s problem areas in Europe, such as migration and language or urban life and language use. In particular, I am interested in the case of Catalan, which has been studied for some time by proponents of the North American enregisterment theory. This leads me to indicate that explicit forms of social conduct, such as language shift or the emblematic use of linguistic forms, can be interpreted with regard to the social indexicality of Catalan. I thus analyze them in a way which shows that authenticity and integration in Catalan society can be achieved to a considerable extent by practicing forms of linguistic enregisterment.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Graph theory. Formal languages' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography