English
Related papers

Related papers: On Languages Generated by Signed Grammars

200 papers

Most scripting languages nowadays use regex pattern-matching libraries. These regex libraries borrow the syntax of regular expressions, but have an informal semantics that is different from the semantics of regular expressions, removing the…

Formal Languages and Automata Theory · Computer Science 2014-02-17 Sérgio Medeiros , Fabio Mascarenhas , Roberto Ierusalimschy

Techniques are developed for creating new and general language families of only semilinear languages, and for showing families only contain semilinear languages. It is shown that for language families L that are semilinear full trios, the…

Formal Languages and Automata Theory · Computer Science 2022-12-05 Oscar H. Ibarra , Ian McQuillan

Sign Language is the dominant yet non-primary form of communication language used in the deaf and hearing-impaired community. To make an easy and mutual communication between the hearing-impaired and the hearing communities, building a…

Computer Vision and Pattern Recognition · Computer Science 2021-03-31 Razieh Rastgoo , Kourosh Kiani , Sergio Escalera , Mohammad Sabokrou

This paper deals with the control generation of right linear grammars with unknown behaviors (RLUBs, for short) in which derivation behavior is not determined completely. In particular, we consider a physical property of control devices…

Formal Languages and Automata Theory · Computer Science 2024-03-08 Daihei Ise , Satoshi Kobayashi

Context-dependent fusion grammars were recently introduced as devices for the generation of hypergraph languages. In this paper, we show that this new type of hypergraph grammars, where the application of fusion rules is restricted by…

Formal Languages and Automata Theory · Computer Science 2019-12-23 Aaron Lye

Existing technology can parse arbitrary context-free grammars, but only a single, static grammar per input. In order to support more powerful syntax-extension systems, we propose reflective grammars, which can modify their own syntax during…

Programming Languages · Computer Science 2011-02-14 Paul Stansifer , Mitchell Wand

We propose a new grammar-based language for defining information-extractors from documents (text) that is built upon the well-studied framework of document spanners for extracting structured data from text. While previously studied…

Databases · Computer Science 2023-01-25 Liat Peterfreund

Formal language techniques have been used in the past to study autonomous dynamical systems. However, for controlled systems, new features are needed to distinguish between information generated by the system and input control. We show how…

Computation and Language · Computer Science 2007-05-23 J. F. Martins , J. A. Dente , A. J. Pires , R. Vilela Mendes

Languages vary widely in how meanings map to word forms. These mappings have been found to support efficient communication; however, this theory does not account for systematic relations within word forms. We examine how a restricted set of…

Computation and Language · Computer Science 2026-01-27 Doreen Osmelak , Yang Xu , Michael Hahn , Kate McCurdy

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related to the computational power of such systems, and finding a…

Formal Languages and Automata Theory · Computer Science 2009-11-13 Paola Bonizzoni , Clelia De Felice , Rosalba Zizza

We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. The proof is by contradiction: we encode Dyck words into a context-free tree language and prove that its preimage under a…

Formal Languages and Automata Theory · Computer Science 2015-10-20 Johannes Osterholzer , Toni Dietze , Luisa Herrmann

We introduce ologisms. They generate from ologs by extending their logical expressivity, from the possibility of considering constraints of equational nature only to the possibility of considering constraints of syllogistic nature, in…

Logic in Computer Science · Computer Science 2023-06-22 Ruggero Pagnan

In this paper, we present an approach to define the semantics for object-oriented modeling languages. One important property of this semantics is to support underspecified and incomplete models. To this end, semantics is given as predicates…

Software Engineering · Computer Science 2014-09-24 Hans Grönninger , Jan Oliver Ringert , Bernhard Rumpe

We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids. Each weighted regular tree grammar with storage generates a…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Zoltán Fülöp , Luisa Herrmann , Heiko Vogler

Formal languages let us define the textual representation of data with precision. Formal grammars, typically in the form of BNF-like productions, describe the language syntax, which is then annotated for syntax-directed translation and…

Formal Languages and Automata Theory · Computer Science 2015-01-15 Luis Quesada , Fernando Berzal , Juan-Carlos Cubero

We define two words in a language to be connected if they express similar concepts. The network of connections among the many thousands of words that make up a language is important not only for the study of the structure and evolution of…

Disordered Systems and Neural Networks · Physics 2009-11-07 Adilson E. Motter , Alessandro P. S. de Moura , Ying-Cheng Lai , Partha Dasgupta

Accounts of semantic phenomena often involve extending types of meanings and revising composition rules at the same time. The concept of monads allows many such accounts -- for intensionality, variable binding, quantification and focus --…

Computation and Language · Computer Science 2007-05-23 Chung-chieh Shan

We propose a grounded approach to meaning in language typology. We treat data from perceptual modalities, such as images, as a language-agnostic representation of meaning. Hence, we can quantify the function--form relationship between…

Computation and Language · Computer Science 2024-12-16 Coleman Haley , Sharon Goldwater , Edoardo Ponti

Most definitions of ontology, viewed as a "specification of a conceptualization", agree on the fact that if an ontology can take different forms, it necessarily includes a vocabulary of terms and some specification of their meaning in…

Artificial Intelligence · Computer Science 2008-01-09 Christophe Roche

We propose a scalable framework for deciding, proving, and explaining (in-)equivalence of context-free grammars. We present an implementation of the framework and evaluate it on large data sets collected within educational support systems.…

Formal Languages and Automata Theory · Computer Science 2026-04-09 Marko Schmellenkamp , Thomas Zeume , Sven Argo , Sandra Kiefer , Cedric Siems , Fynn Stebel
‹ Prev 1 8 9 10 Next ›