Log in

Relevant bibliographies by topics / Regular expressions and languages / Journal articles

To see the other types of publications on this topic, follow the link: Regular expressions and languages.

Journal articles on the topic 'Regular expressions and languages'

Author: Grafiati

Published: 7 September 2021

Last updated: 29 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Regular expressions and 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Soufi, Loutfi. "Type Specification by Regular Expressions." JUCS - Journal of Universal Computer Science 5, no. (9) (1999): 622–31. https://doi.org/10.3217/jucs-005-09-0622.

Full text

Abstract:

Generally, programming problems are formally described as function computation problems. In this paper they are viewed as language recognition problems. More precisely, we sugget to specify types, and programs using the concept of languages of concatenation of level n, i.e, languages built from regular languages on which language transformation operations are applied to them. Regular languages denoted by regular expressions allow an easy connection between those languages of concatenation and programming. This connection is naturally done via recurrence relations. We explain our approach throu

APA, Harvard, Vancouver, ISO, and other styles

2

Hashiguchi, Kosaburo, Yoshito Wada, and Shuji Jimbo. "Regular binoid expressions and regular binoid languages." Theoretical Computer Science 304, no. 1-3 (2003): 291–313. http://dx.doi.org/10.1016/s0304-3975(03)00137-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

CÂMPEANU, CEZAR, KAI SALOMAA, and SHENG YU. "A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS." International Journal of Foundations of Computer Science 14, no. 06 (2003): 1007–18. http://dx.doi.org/10.1142/s012905410300214x.

Full text

Abstract:

Regular expressions are used in many practical applications. Practical regular expressions are commonly called "regex". It is known that regex are different from regular expressions. In this paper, we give regex a formal treatment. We make a distinction between regex and extended regex; while regex represent regular languages, extended regex represent a family of languages larger than regular languages. We prove a pumping lemma for the languages expressed by extended regex. We show that the languages represented by extended regex are incomparable with context-free languages and a proper subset

APA, Harvard, Vancouver, ISO, and other styles

4

Nagy, Benedek. "Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages." International Journal of Foundations of Computer Science 32, no. 05 (2021): 551–73. http://dx.doi.org/10.1142/s0129054121410070.

Full text

Abstract:

Union-free expressions are regular expressions without using the union operation. Consequently, (nondeterministic) union-free languages are described by regular expressions using only concatenation and Kleene star. The language class is also characterised by a special class of finite automata: 1CFPAs have exactly one cycle-free accepting path from each of their states. Obviously such an automaton has exactly one accepting state. The deterministic counterpart of such class of automata defines the deterministic union-free (d-union-free, for short) languages. In this paper [Formula: see text]-fre

APA, Harvard, Vancouver, ISO, and other styles

5

HAN, YO-SUB, YAJUN WANG, and DERICK WOOD. "INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES." International Journal of Foundations of Computer Science 17, no. 02 (2006): 379–93. http://dx.doi.org/10.1142/s0129054106003887.

Full text

Abstract:

We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and develop a polynomial-time algorithm to determine infix-freeness of a regular language using state-pair graphs. We consider two cases: 1) A language is specified by a nondeterministic finite-state automaton and 2) a language is specified by a regular expression. Furthermore, we examine the prime infix-free decomposition of infix-free regular languages and design an algorithm for the infix-free primality test of an infix-free regular language. Moreover, we show that w

APA, Harvard, Vancouver, ISO, and other styles

6

Barceló, Pablo, Juan Reutter, and Leonid Libkin. "Parameterized regular expressions and their languages." Theoretical Computer Science 474 (February 2013): 21–45. http://dx.doi.org/10.1016/j.tcs.2012.12.036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

BAETEN, JOS C. M., BAS LUTTIK, TIM MULLER, and PAUL VAN TILBURG. "Expressiveness modulo bisimilarity of regular expressions with parallel composition." Mathematical Structures in Computer Science 26, no. 6 (2015): 933–68. http://dx.doi.org/10.1017/s0960129514000309.

Full text

Abstract:

The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the effect on expressiveness. First we prove that adding pure interleaving to the theory of regular expressions strictly increases its expressiveness modulo bisimilarity. Then, we prove that replacing the operation for pure interleaving by ACP-style

APA, Harvard, Vancouver, ISO, and other styles

8

JIRÁSKOVÁ, GALINA, and TOMÁŠ MASOPUST. "COMPLEXITY IN UNION-FREE REGULAR LANGUAGES." International Journal of Foundations of Computer Science 22, no. 07 (2011): 1639–53. http://dx.doi.org/10.1142/s0129054111008933.

Full text

Abstract:

We continue the investigation of union-free regular languages that are described by regular expressions without the union operation. We also define deterministic union-free languages as languages accepted by one-cycle-free-path deterministic finite automata, and show that they are properly included in the class of union-free languages. We prove that (deterministic) union-freeness of languages does not accelerate regular operations, except for the reversal in the nondeterministic case.

APA, Harvard, Vancouver, ISO, and other styles

9

Kaminski, Michael, and Tony Tan. "Regular Expressions for Languages over Infinite Alphabets." Fundamenta Informaticae 69, no. 3 (2006): 301–18. https://doi.org/10.3233/fun-2006-69304.

Full text

Abstract:

In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if it is accepted by finite-state unification based automaton – a model of computation that is tightly related to other models of automata over infinite alphabets.

APA, Harvard, Vancouver, ISO, and other styles

10

Gelle, Kitti, and Szabolcs Iván. "Regular Expressions for Muller Context-Free Languages." Acta Cybernetica 23, no. 1 (2017): 349–69. http://dx.doi.org/10.14232/actacyb.23.1.2017.19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Breveglieri, L. "Fair expressions and regular languages over lists." RAIRO - Theoretical Informatics and Applications 31, no. 1 (1997): 15–66. http://dx.doi.org/10.1051/ita/1997310100151.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Sakharov, Alexander. "Annotated regular expressions and input-driven languages." Information Processing Letters 159-160 (July 2020): 105958. http://dx.doi.org/10.1016/j.ipl.2020.105958.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

LOHREY, MARKUS. "COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA." International Journal of Foundations of Computer Science 21, no. 05 (2010): 817–41. http://dx.doi.org/10.1142/s012905411000757x.

Full text

Abstract:

Membership problems for compressed strings in regular languages are investigated. Strings are represented by straight-line programs, i.e., context-free grammars that generate exactly one string. For the representation of regular languages, various formalisms with different degrees of succinctness (e.g., suitably extended regular expressions, hierarchical automata) are considered. Precise complexity bounds are derived. Among other results, it is shown that the compressed membership problem for regular expressions with intersection is PSPACE-complete. This solves an open problem of Plandowski an

APA, Harvard, Vancouver, ISO, and other styles

14

Hashiguchi, Kosaburo, Naoto Sakakibara, and Shuji Jimbo. "Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids." Theoretical Computer Science 312, no. 2-3 (2004): 251–66. http://dx.doi.org/10.1016/j.tcs.2003.09.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Syzdykov, Mirzakhmet. "Deterministic automata for extended regular expressions." Open Computer Science 7, no. 1 (2017): 24–28. http://dx.doi.org/10.1515/comp-2017-0004.

Full text

Abstract:

Abstract In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement. The method like “overriding” of the source NFA(NFA not defined) with subset construction rules is used. The past work described only the algorithm for AND-operator (or intersection of regular languages); in this paper the construction for the MINUS-operator (and complement) is shown.

APA, Harvard, Vancouver, ISO, and other styles

16

Kutrib, Martin, and Matthias Wendlandt. "Expressive capacity of subregular expressions." RAIRO - Theoretical Informatics and Applications 52, no. 2-3-4 (2018): 201–18. http://dx.doi.org/10.1051/ita/2018014.

Full text

Abstract:

Different types of subregular expressions are studied. Each type is obtained by either omitting one of the regular operations or replacing it by complementation or intersection. For uniformity and in order to allow non-trivial languages to be expressed, the set of literals is a finite set of words instead of letters. The power and limitations as well as relations with each other are considered, which is often done in terms of unary languages. Characterizations of some of the language families are obtained. A finite hierarchy is shown that reveals that the operation complementation is generally

APA, Harvard, Vancouver, ISO, and other styles

17

Barrière, Aurèle, and Clément Pit-Claudel. "Linear Matching of JavaScript Regular Expressions." Proceedings of the ACM on Programming Languages 8, PLDI (2024): 1336–60. http://dx.doi.org/10.1145/3656431.

Full text

Abstract:

Modern regex languages have strayed far from well-understood traditional regular expressions: they include features that fundamentally transform the matching problem. In exchange for these features, modern regex engines at times suffer from exponential complexity blowups, a frequent source of denial-of-service vulnerabilities in JavaScript applications. Worse, regex semantics differ across languages, and the impact of these divergences on algorithmic design and worst-case matching complexity has seldom been investigated. This paper provides a novel perspective on JavaScript's regex semantics b

APA, Harvard, Vancouver, ISO, and other styles

18

Della Monica, Dario, Angelo Montanari та Pietro Sala. "Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata". Electronic Proceedings in Theoretical Computer Science 256 (6 вересня 2017): 223–37. http://dx.doi.org/10.4204/eptcs.256.16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Geffert, Viliam, Carlo Mereghetti, and Beatrice Palano. "More concise representation of regular languages by automata and regular expressions." Information and Computation 208, no. 4 (2010): 385–94. http://dx.doi.org/10.1016/j.ic.2010.01.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Blanco Arbe, José Miguel, Ana Sánchez Ortega, and Jesús Ibáñez Mártinez-Conde. "Formal languages through web forms and regular expressions." ACM SIGCSE Bulletin 39, no. 4 (2007): 100–104. http://dx.doi.org/10.1145/1345375.1345424.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Morazán, Marco T. "Regular Expressions in a CS Formal Languages Course." Electronic Proceedings in Theoretical Computer Science 382 (August 11, 2023): 45–63. http://dx.doi.org/10.4204/eptcs.382.3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Abdallah, Bilal, and Benedek Nagy. "On Concatenations of Regular Circular Word Languages." Mathematics 13, no. 5 (2025): 763. https://doi.org/10.3390/math13050763.

Full text

Abstract:

In this paper, one-wheel and two-wheel concatenations of circular words and their languages are investigated. One-wheel concatenation is an operation that is commutative but not associative, while two-wheel concatenation is associative but not commutative. Moreover, two-wheel concatenation may produce languages that are not languages of circular words. We define two classes of regular languages of circular words based on finite automata: in a weakly accepted circular word language, at least one conjugate of each word is accepted by the automaton; in contrast, a strongly accepted language consi

APA, Harvard, Vancouver, ISO, and other styles

23

Bhuvaneswari, K., and T. Nancy Dora. "GEOMETRIC STRUCTURE OF TWO DIMENSIONAL HEXAGONAL PATTERNS." YMER Digital 21, no. 06 (2022): 1034–47. http://dx.doi.org/10.37896/ymer21.06/a0.

Full text

Abstract:

A new type of hexagonal regular expressions using operations like linking side borders, land corners and gluing corners for two dimensional languages using arbitrary shapes and tiling operations parameterized by restrictions of the connection interfaces is introduced. Expressions recognizing chains and pretzel shape pictures using hexagonal pixels over the given alphabet are developed. This is an interesting theoretic model comes from a different perspective: the technique of using tiling to describe the syntax and semantics of the computing system. The present approach is an attempt to extend

APA, Harvard, Vancouver, ISO, and other styles

24

Elliott, Conal. "Symbolic and automatic differentiation of languages." Proceedings of the ACM on Programming Languages 5, ICFP (2021): 1–18. http://dx.doi.org/10.1145/3473583.

Full text

Abstract:

Formal languages are usually defined in terms of set theory. Choosing type theory instead gives us languages as type-level predicates over strings. Applying a language to a string yields a type whose elements are language membership proofs describing how a string parses in the language. The usual building blocks of languages (including union, concatenation, and Kleene closure) have precise and compelling specifications uncomplicated by operational strategies and are easily generalized to a few general domain-transforming and codomain-transforming operations on predicates. A simple characteriza

APA, Harvard, Vancouver, ISO, and other styles

25

NEDERHOF, M. J., and E. BERTSCH. "An innovative finite state concept for recognition and parsing of context-free languages." Natural Language Engineering 2, no. 4 (1996): 381–82. http://dx.doi.org/10.1017/s1351324997001666.

Full text

Abstract:

In the full paper in the companion volume, we introduce a new subclass of the context free languages, the meta-deterministic languages, which includes the deterministic languages, but also the languages that result if deterministic languages are combined via regular expressions.

APA, Harvard, Vancouver, ISO, and other styles

26

Câmpeanu, Cezar, and Nicolae Santean. "On the closure of pattern expressions languages under intersection with regular languages." Acta Informatica 46, no. 3 (2009): 193–207. http://dx.doi.org/10.1007/s00236-009-0090-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

SCHMID, MARKUS L. "INSIDE THE CLASS OF REGEX LANGUAGES." International Journal of Foundations of Computer Science 24, no. 07 (2013): 1117–34. http://dx.doi.org/10.1142/s0129054113400340.

Full text

Abstract:

We study different possibilities of combining the concept of homomorphic replacement with regular expressions in order to investigate the class of languages given by extended regular expressions with backreferences (REGEX). It is shown in which regard existing and natural ways to do this fail to reach the expressive power of REGEX. Furthermore, the complexity of the membership problem for REGEX with a bounded number of backreferences is considered.

APA, Harvard, Vancouver, ISO, and other styles

28

Hall, Cordelia, and John T. O'Donnell. "Regular Expressions as Violin Bowing Patterns." Computer Music Journal 36, no. 2 (2012): 74–84. http://dx.doi.org/10.1162/comj_a_00120.

Full text

Abstract:

String players spend a significant amount of practice time creating and learning bowings. These may be indicated in the music using up-bow and down-bow symbols, but those traditional notations do not capture the complex bowing patterns that are latent within the music. Regular expressions, a mathematical notation for a simple class of formal languages, can describe precisely the bowing patterns that commonly arise in string music. A software tool based on regular expressions enables performers to search for passages that can be handled with similar bowings, and to edit them consistently. A com

APA, Harvard, Vancouver, ISO, and other styles

29

Gyurica, György. "On Nilpotent Languages and Their Characterization by Regular Expressions." Acta Cybernetica 19, no. 1 (2009): 231–44. http://dx.doi.org/10.14232/actacyb.19.1.2009.15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Barozzini, David, David de Frutos-Escrig, Dario Della Monica, Angelo Montanari та Pietro Sala. "Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts". Theoretical Computer Science 813 (квітень 2020): 270–304. http://dx.doi.org/10.1016/j.tcs.2019.12.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

KARTTUNEN, L., J.-P. CHANOD, G. GREFENSTETTE, and A. SCHILLE. "Regular expressions for language engineering." Natural Language Engineering 2, no. 4 (1996): 305–28. http://dx.doi.org/10.1017/s1351324997001563.

Full text

Abstract:

Many of the processing steps in natural language engineering can be performed using finite state transducers. An optimal way to create such transducers is to compile them from regular expressions. This paper is an introduction to the regular expression calculus, extended with certain operators that have proved very useful in natural language applications ranging from tokenization to light parsing. The examples in the paper illustrate in concrete detail some of these applications.

APA, Harvard, Vancouver, ISO, and other styles

32

Grigoryan, T. A. "SOME RESULTS ON REGULAR EXPRESSIONS FOR MULTITAPE FINITE AUTOMATA." Proceedings of the YSU A: Physical and Mathematical Sciences 53, no. 2 (249) (2019): 82–90. http://dx.doi.org/10.46991/pysu:a/2019.53.2.082.

Full text

Abstract:

We consider sets of word tuples accepted by multitape finite automata. We use the known notation for regular expressions that describes languages accepted by one-tape automata. Nevertheless, the interpretation of the "concatenation" operation is different in this case. The algebra of events for multitape finite automata is defined in the same way as for one-tape automata. It is shown that the introduced algebra is a Kleene algebra. It is also, shown that some known results for the algebra of events accepted by one-tape finite automata are valid in this case too.

APA, Harvard, Vancouver, ISO, and other styles

33

Valizadeh, Mojtaba, and Martin Berger. "Search-Based Regular Expression Inference on a GPU." Proceedings of the ACM on Programming Languages 7, PLDI (2023): 1317–39. http://dx.doi.org/10.1145/3591274.

Full text

Abstract:

Regular expression inference (REI) is a supervised machine learning and program synthesis problem that takes a cost metric for regular expressions, and positive and negative examples of strings as input. It outputs a regular expression that is precise (i.e., accepts all positive and rejects all negative examples), and minimal w.r.t. to the cost metric. We present a novel algorithm for REI over arbitrary alphabets that is enumerative and trades off time for space. Our main algorithmic idea is to implement the search space of regular expressions succinctly as a contiguous matrix of bitvectors. C

APA, Harvard, Vancouver, ISO, and other styles

34

Veanes, Margus, Thomas Ball, Gabriel Ebner, and Ekaterina Zhuchko. "Symbolic Automata: Omega-Regularity Modulo Theories." Proceedings of the ACM on Programming Languages 9, POPL (2025): 33–66. https://doi.org/10.1145/3704838.

Full text

Abstract:

Symbolic automata are finite state automata that support potentially infinite alphabets, such as the set of rational numbers, generally applied to regular expressions and languages over finite words. In symbolic automata (or automata modulo A ), an alphabet is represented by an effective Boolean algebra A , supported by a decision procedure for satisfiability. Regular languages over infinite words (so called ω-regular languages) have a rich history paralleling that of regular languages over finite words, with well-known applications to model checking via Büchi automata and temporal logics. We

APA, Harvard, Vancouver, ISO, and other styles

35

Liang, Qi, Dian Ouyang, Fan Zhang, Jianye Yang, Xuemin Lin, and Zhihong Tian. "Efficient Regular Simple Path Queries under Transitive Restricted Expressions." Proceedings of the VLDB Endowment 17, no. 7 (2024): 1710–22. http://dx.doi.org/10.14778/3654621.3654636.

Full text

Abstract:

There are two fundamental problems in regular simple path queries (RSPQs). One is the reachability problem which asks whether there exists a simple path between the source and the target vertex matching the given regular expression, and the other is the enumeration problem which aims to find all the matched simple paths. As an important computing component of graph databases, RSPQs are supported in many graph database query languages such as PGQL and openCypher. However, answering RSPQs is known to be NP-hard, making it challenging to design scalable solutions to support a wide range of expres

APA, Harvard, Vancouver, ISO, and other styles

36

Silva, Alexandra. "Position Automata for Kleene Algebra with Tests." Scientific Annals of Computer Science XXII, no. 2 (2012): 367–94. https://doi.org/10.7561/SACS.2012.2.367.

Full text

Abstract:

Kleene algebra with tests (KAT) is an equational system that combines Kleene and Boolean algebras. One can model basic programming constructs and assertions in KAT, which allowed for its application in compiler optimization, program transformation and dataflow analysis. To provide semantics for KAT expressions, Kozen first introduced emph{automata on guarded strings}, showing that the regular sets of guarded strings plays the same role in KAT as regular languages play in Kleene algebra. Recently, Kozen described an elegant algorithm, based on “derivatives”, to construct a determini

APA, Harvard, Vancouver, ISO, and other styles

37

Adilbekova, Aidyn Kambarbekovna. "Features of phraseological units in Kazakh and English languages." Bulletin of Toraighyrov University. Philology series, no. 2,2021 (June 1, 2021): 9–14. http://dx.doi.org/10.48081/ijfk5316.

Full text

Abstract:

The article deals with one of the most important issues of translation science – the translation of phraseological units from one language to another. It is known that translation is the main means of communication between two cultures, acquaintance with the culture and life of other peoples. There are many problems with translating from English to Kazakh. One of them is the translation of phraseology. It also analyzes the types of regular expressions and the composition of regular expressions that belong to the same group. There are also several examples of phraseology used to describe charac

APA, Harvard, Vancouver, ISO, and other styles

38

Statkevych, Vitalii M. "Regular expressions for some Petri net languages for the producer/consumer problem." System research and information technologies, no. 3 (December 7, 2020): 105–23. http://dx.doi.org/10.20535/srit.2308-8893.2020.3.08.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

HOLZER, MARKUS, and SEBASTIAN JAKOBI. "NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY." International Journal of Foundations of Computer Science 25, no. 07 (2014): 837–55. http://dx.doi.org/10.1142/s0129054114400115.

Full text

Abstract:

We investigate the descriptional complexity of nondeterministic biautomata, which are a generalization of biautomata [O. KLÍMA, L. POLÁK: On biautomata. RAIRO — Theor. Inf. Appl., 46(4), 2012]. Simply speaking, biautomata are finite automata reading the input from both sides; although the head movement is nondeterministic, additional requirements enforce biautomata to work deterministically. First we study the size blow-up when determinizing nondeterministic biautomata. Further, we give tight bounds on the number of states for nondeterministic biautomata accepting regular languages relative to

APA, Harvard, Vancouver, ISO, and other styles

40

Insuasty, Edwin, and Jesús Insuasti. "Comparing the speed of searching for a regular expression versus classic string search functions." Edelweiss Applied Science and Technology 9, no. 1 (2025): 1129–37. https://doi.org/10.55214/25768484.v9i1.4349.

Full text

Abstract:

This study investigates the comparative efficiency of regular expressions and native string search methods in object-oriented programming languages such as Java and C#. String search methods, including Index of, Last Index of, and Contains, are commonly employed in programming tasks. However, their performance often deteriorates with increased text size. By contrast, regular expressions offer a versatile and powerful approach to text search, making them an appealing alternative. The research employed an empirical methodology, evaluating execution times for both approaches on four computers wit

APA, Harvard, Vancouver, ISO, and other styles

41

McILROY, M. DOUGLAS. "Enumerating the strings of regular languages." Journal of Functional Programming 14, no. 5 (2004): 503–18. http://dx.doi.org/10.1017/s0956796803004982.

Full text

Abstract:

Haskell code is developed for two ways to list the strings of the language defined by a regular expression: directly by set operations and indirectly by converting to and simulating an equivalent automaton. The exercise illustrates techniques for dealing with infinite ordered domains and leads to an effective standard form for nondeterministic finite automata.

APA, Harvard, Vancouver, ISO, and other styles

42

Anselmo, Marcella, Dora Giammarresi, and Maria Madonia. "New operations and regular expressions for two-dimensional languages over one-letter alphabet." Theoretical Computer Science 340, no. 2 (2005): 408–31. http://dx.doi.org/10.1016/j.tcs.2005.03.031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

OKHOTIN, ALEXANDER. "EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES." International Journal of Foundations of Computer Science 14, no. 06 (2003): 1103–16. http://dx.doi.org/10.1142/s0129054103002205.

Full text

Abstract:

Linear conjunctive grammars have recently been proved computationally equivalent to triangular trellis automata. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter are considerably easier to implement. This paper studies efficient algorithms for converting a linear conjunctive grammar to an equivalent triangular trellis automaton, and also proposes a number of techniques of reducing the size of these automata.

APA, Harvard, Vancouver, ISO, and other styles

44

Jia, Xiaodong, and Gang Tan. "V-Star: Learning Visibly Pushdown Grammars from Program Inputs." Proceedings of the ACM on Programming Languages 8, PLDI (2024): 2003–26. http://dx.doi.org/10.1145/3656458.

Full text

Abstract:

Accurate description of program inputs remains a critical challenge in the field of programming languages. Active learning, as a well-established field, achieves exact learning for regular languages. We offer an innovative grammar inference tool, V-Star, based on the active learning of visibly pushdown automata. V-Star deduces nesting structures of program input languages from sample inputs, employing a novel inference mechanism based on nested patterns. This mechanism identifies token boundaries and converts languages such as XML documents into VPLs. We then adapted Angluin's L-Star, an exact

APA, Harvard, Vancouver, ISO, and other styles

45

Hirshfeld, Yoram. "UNDECIDABILITY OF LANGUAGE EQUIVALENCE FOR GENERALIZED REGULAR EXPRESSIONS." Fundamenta Informaticae 26, no. 1 (1996): 95–102. http://dx.doi.org/10.3233/fi-1996-2617.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Radanne, Gabriel, and Peter Thiemann. "Regenerate: a language generator for extended regular expressions." ACM SIGPLAN Notices 53, no. 9 (2020): 202–14. http://dx.doi.org/10.1145/3393934.3278133.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Gruber, Hermann, and Markus Holzer. "Language operations with regular expressions of polynomial size." Theoretical Computer Science 410, no. 35 (2009): 3281–89. http://dx.doi.org/10.1016/j.tcs.2009.04.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Hanneyan, Mariné. "Հայրենի հ.-ե. ծագման ուտեփք ֊ըմպելիք նշանակող բառերի տարա óp այի ն ֊րմաստա յի ս և ստուգաբանական վերլուծություն / Analyse structurelle, sémantique et étymologique des termes arméniens d’origine i.-e. désignant des aliments ou des boissons". Slovo 26, № 1 (2001): 205–11. https://doi.org/10.3406/slovo.2001.1255.

Full text

Abstract:

The words expressing food-drink are relatively stable in terms of their meaning as well as in terms of linguistic expressions, so they can serve as considerably reliable material in detecting the degree of proximity between Armenian and other languages of I.-E. origin , in clarifying some problems connected with the word structure and word meaning. According to the degree of participation of cognate languages-major, minor and isolated areas were identified. Isoglosses having place in the majority (about half and more) of I.-E. languages compose the major area. Isoglosses expressed in few cogna

APA, Harvard, Vancouver, ISO, and other styles

49

Pekunov, Vladimir Viktorovich. "New built-in tools for extending the Planning C language." Программные системы и вычислительные методы, no. 1 (January 2022): 32–41. http://dx.doi.org/10.7256/2454-0714.2022.1.37240.

Full text

Abstract:

In this paper, the problem of developing language extensions of Planning C (a dialect of C++) is considered. The review of existing external programs and solutions built into languages that allow translating new constructions introduced into the language into the output code is carried out. Based on the analysis, it is concluded that the most natural solution built into the language will be some combination of improved regular expressions (to highlight new constructions) with code generators based on procedural and syntactic macros. At the same time, it is advisable to use elements of direct l

APA, Harvard, Vancouver, ISO, and other styles

50

Statkevych, Vitalii. "Set difference operation for regular Petri net languages for the producer/consumer problem with the bounded buffer." System research and information technologies, no. 2 (September 14, 2021): 94–112. http://dx.doi.org/10.20535/srit.2308-8893.2021.2.08.

Full text

Abstract:

We consider a Petri net for the producer/consumer problem (one of the classical synchronization problems) with the bounded buffer of size n and the regular formal languages Ln, generated by the net. The objective of this paper is to obtain a regular expression for the set difference of languages Ln \ Lm, n > m. For this purpose, we give the finite automaton which accepts the set difference of mentioned languages, and then we use the state elimination method to obtain the regular expression in the recursive form. The main result is illustrated by the examples. In an appendix, we consider the

APA, Harvard, Vancouver, ISO, and other styles

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!