Log in

Relevant bibliographies by topics / Rational languages / Journal articles

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

Journal articles on the topic 'Rational languages'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 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 'Rational 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

Wang, Huaxiong. "On rational series and rational languages." Theoretical Computer Science 205, no. 1-2 (1998): 329–36. http://dx.doi.org/10.1016/s0304-3975(98)00103-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Denis, François, and Yann Esposito. "On Rational Stochastic Languages." Fundamenta Informaticae 86, no. 1-2 (2008): 41–77. https://doi.org/10.3233/fun-2008-861-203.

Full text

Abstract:

The goal of the present paper is to provide a study of rational stochastic languages over a semiring K ∈ {Q,R,Q ^+ ,R ^+ }. A rational stochastic language is a probability distribution over a free monoid Σ*, which is rational over K, that is, which can be generated by a multiplicity automaton with parameters in K. We study the relations between the classes of rational stochastic languages S ^{rat} _K (Σ). We define the notion of residual language of a stochastic language and we use it to investigate properties of several subclasses of rational stochastic languages. Then, we study the represent

APA, Harvard, Vancouver, ISO, and other styles

3

SHUR, ARSENY M. "RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES." International Journal of Foundations of Computer Science 18, no. 03 (2007): 655–65. http://dx.doi.org/10.1142/s0129054107004887.

Full text

Abstract:

We approximate factorial languages by languages with finite antidictionaries. Let s and m be positive integers with s ≤ m. We construct a language of complexity Θ(ns), and a sequence of languages with finite antidictionaries, each of those having the complexity Θ(nm), such that this sequence converges to the original language.

APA, Harvard, Vancouver, ISO, and other styles

4

Angrand, Pierre-Yves, and Jacques Sakarovitch. "Radix enumeration of rational languages." RAIRO - Theoretical Informatics and Applications 44, no. 1 (2010): 19–36. http://dx.doi.org/10.1051/ita/2010003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Marsault, Victor, and Jacques Sakarovitch. "The signature of rational languages." Theoretical Computer Science 658 (January 2017): 216–34. http://dx.doi.org/10.1016/j.tcs.2016.04.023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Choffrut, Christian, Flavio D’Alessandro, and Stefano Varricchio. "On Bounded Rational Trace Languages." Theory of Computing Systems 46, no. 2 (2008): 351–69. http://dx.doi.org/10.1007/s00224-008-9143-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zhang, Louxin. "Rational strong codes and structure of rational group languages." Semigroup Forum 35, no. 1 (1986): 181–93. http://dx.doi.org/10.1007/bf02573102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

MONTALBANO, ROSA, and ANTONIO RESTIVO. "ON THE STAR HEIGHT OF RATIONAL LANGUAGES." International Journal of Algebra and Computation 04, no. 03 (1994): 427–41. http://dx.doi.org/10.1142/s0218196794000075.

Full text

Abstract:

Two problems concerning the star height of a rational language are investigated: the star height one problem and the relationships between the unambiguity of an expression and its star height. For this purpose we consider the class of factorial, transitive and rational (FTR) languages. From the algebraic point of view a FTR language is the set of factors of a rational submonoid M. Two subclasses of FTR languages are introduced: renewal languages, corresponding to the case of M finitely generated, and unambiguous renewal languages, corresponding to the case of M finitely generated and free. We

APA, Harvard, Vancouver, ISO, and other styles

9

Konstantinidis, Stavros, Santean Nicolae, and Sheng Yu. "Fuzzification of Rational and Recognizable Sets." Fundamenta Informaticae 76, no. 4 (2007): 413–47. https://doi.org/10.3233/fun-2007-76402.

Full text

Abstract:

In this paper we present a different framework for the study of fuzzy finite machines and their fuzzy languages. Unlike the previous work on fuzzy languages, characterized by fuzzification at the level of their acceptors/generators, here we follow a top-down approach by starting our fuzzification with more abstract entities: monoids and particular families in monoids. Moreover, we replace the unit interval (in fact, a finite subset of the unit interval) as support for fuzzy values with the more general structure of a lattice. We have found that completely distributive complete lattices allow t

APA, Harvard, Vancouver, ISO, and other styles

10

SILVA, PEDRO V. "RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS." International Journal of Algebra and Computation 02, no. 02 (1992): 187–207. http://dx.doi.org/10.1142/s0218196792000128.

Full text

Abstract:

The aim of this note is to emphasize the connection between the idempotent word problem for inverse monoid presentations and certain left closed subsets of the free group. The wide use of automata and languages throughout the paper justifies our choice of considering the free group as a subset of the free monoid. Automata theory is used to provide a decidability result concerning rational languages. As a consequence, an alternative proof to the theorem of Meakin and Margolis on idempotent-pure presentations [7] is obtained, and some new cases are established. Moreover, an example of a finitely

APA, Harvard, Vancouver, ISO, and other styles

11

BONOPERA, ALAIN, and BRUNO GAUJAL. "INFERENCE OF REVERSIBLE LANGUAGES." International Journal of Algebra and Computation 02, no. 03 (1992): 327–49. http://dx.doi.org/10.1142/s0218196792000207.

Full text

Abstract:

We consider inductive inference of certain classes of languages, namely the k-reversible languages for some fixed k≥0, from positive, possibly infinite samples. More precisely, given any rational language S, the sample, we prove that there exists a smallest, with respect to inclusion, k-reversible language containing it, which is then also rational. After an algebraic proof, we describe a polynomial algorithm performing the inference.

APA, Harvard, Vancouver, ISO, and other styles

12

Latteux, Michel, and Yves Roos. "On rationally controlled one-rule insertion systems." RAIRO - Theoretical Informatics and Applications 56 (2022): 8. http://dx.doi.org/10.1051/ita/2022008.

Full text

Abstract:

Rationally controlled one-rule insertion systems are one-rule string rewriting systems for which the rule, that is to insert a given word, may be applied in a word only behind a prefix that must belong to a given rational language called the control language. As for general string rewriting systems, these controlled insertion systems induce a transformation over languages: from a starting word, one can associate all its descendants. In this paper, we investigate the behavior of these systems in terms of preserving the classes of languages: finite, rational and context-free languages. We show t

APA, Harvard, Vancouver, ISO, and other styles

13

Silva, Pedro V. "Free group languages: Rational versus recognizable." RAIRO - Theoretical Informatics and Applications 38, no. 1 (2004): 49–67. http://dx.doi.org/10.1051/ita:2004003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Foryś, Wit. "Fixed point languages of rational transductions." Semigroup Forum 34, no. 1 (1986): 177–83. http://dx.doi.org/10.1007/bf02573161.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Wang, Huaxiong. "On syntactic nuclei of rational languages." Information Processing Letters 67, no. 5 (1998): 221–26. http://dx.doi.org/10.1016/s0020-0190(98)00120-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Restivo, A. "Rational languages and the Burnside problem." Theoretical Computer Science 40 (1985): 67–84. http://dx.doi.org/10.1016/0304-3975(85)90104-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Restivo, Antonio, and Christophe Reutenaeur. "Rational languages and the Burnside problem." Theoretical Computer Science 40 (1985): 13–30. http://dx.doi.org/10.1016/0304-3975(85)90156-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Diekert, V., P. Gastin, and A. Petit. "Rational and Recognizable Complex Trace Languages." Information and Computation 116, no. 1 (1995): 134–53. http://dx.doi.org/10.1006/inco.1995.1010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

CARPI, ARTURO. "ON REPRESENTATION SYSTEMS." International Journal of Algebra and Computation 04, no. 04 (1994): 657–90. http://dx.doi.org/10.1142/s0218196794000191.

Full text

Abstract:

We introduce the notion of a representation system: it can be viewed as a generalization of a numeration system in an integer base by means of which certain words on a finite alphabet can be represented. We show that under suitable hypotheses, concatenation of words is represented by a right-synchronized rational relation. We study languages which are represented by rational sets (this is the case, e. g., of the languages of binary overlap-free words, of partially abelian square-free words on three letters, and of a large class of PD0L languages). Several results on these languages are obtaine

APA, Harvard, Vancouver, ISO, and other styles

20

Bradley, Eleanor. "Functional programming languages for AI problem solving." Knowledge Engineering Review 6, no. 3 (1991): 223–35. http://dx.doi.org/10.1017/s0269888900005816.

Full text

Abstract:

AbstractMany problem domains exhibit inherent parallelism, and parallel systems which capture and exploit this can be used to look for efficient solutions to AI problems. Functional programming languages are expected to be efficiently realisable on fifth generation hardware. A rational reconstruction of AI programming paradigms is used to investigate the programmability and performance of functional languages in this particular area.Three languages—Standard ML, Hope+ and Miranda—are used in the rational reconstruction, each language being used to implement three applications. Results indicate

APA, Harvard, Vancouver, ISO, and other styles

21

Choffrut, C., and L. Guerra. "Logical definability of some rational trace languages." Mathematical Systems Theory 28, no. 5 (1995): 397–420. http://dx.doi.org/10.1007/bf01185864.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hundeshagen, Norbert, and Friedrich Otto. "Restarting Transducers, Regular Languages, and Rational Relations." Theory of Computing Systems 57, no. 1 (2014): 195–225. http://dx.doi.org/10.1007/s00224-014-9579-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Arnold, André. "A syntactic congruence for rational ω-languages". Theoretical Computer Science 39 (1985): 333–35. http://dx.doi.org/10.1016/0304-3975(85)90148-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Litovsky, I., та E. Timmerman. "On generators of rational ω-power languages". Theoretical Computer Science 53, № 2-3 (1987): 187–200. http://dx.doi.org/10.1016/0304-3975(87)90063-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Arnold, André. "A topological property of rational ω-languages". Theoretical Computer Science 151, № 1 (1995): 29–36. http://dx.doi.org/10.1016/0304-3975(95)00046-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

AFONIN, SERGEY, and ELENA KHAZOVA. "MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES." International Journal of Foundations of Computer Science 17, no. 03 (2006): 493–506. http://dx.doi.org/10.1142/s0129054106003954.

Full text

Abstract:

Let Σ be a finite alphabet. A set [Formula: see text] of regular languages over Σ is called rational if there exists a finite set [Formula: see text] of regular languages over Σ such that [Formula: see text] is a rational subset of the finitely generated semigroup [Formula: see text] with [Formula: see text] as the set of generators and language concatenation as a product. We prove that for any rational set [Formula: see text] and any regular language R ⊆ Σ* it is decidable (1) whether [Formula: see text] or not, and (2) whether [Formula: see text] is finite or not. Possible applications to se

APA, Harvard, Vancouver, ISO, and other styles

27

CARNINO, VINCENT, and SYLVAIN LOMBARDY. "FACTORIZATIONS AND UNIVERSAL AUTOMATON OF OMEGA LANGUAGES." International Journal of Foundations of Computer Science 25, no. 08 (2014): 1111–25. http://dx.doi.org/10.1142/s0129054114400279.

Full text

Abstract:

We extend the concept of factorization on finite words to ω-rational languages and show how to compute them. We define a normal form for Büchi automata and introduce a universal automaton for Büchi automata in normal form. We prove that, for every ω-rational language, this Büchi automaton, based on factorization, is canonical and that it is the smallest automaton that contains the morphic image of every equivalent Büchi automaton in normal form.

APA, Harvard, Vancouver, ISO, and other styles

28

Hirvensalo, Mika, Etienne Moutot, and Abuzer Yakaryılmaz. "Computational limitations of affine automata and generalized affine automata." Natural Computing 20, no. 2 (2021): 259–70. http://dx.doi.org/10.1007/s11047-020-09815-1.

Full text

Abstract:

AbstractWe present new results on the computational limitations of affine automata (AfAs). First, we show that using the endmarker does not increase the computational power of AfAs. Second, we show that the computation of bounded-error rational-valued AfAs can be simulated in logarithmic space. Third, we identify some logspace unary languages that are not recognized by algebraic-valued AfAs. Fourth, we show that using arbitrary real-valued transition matrices and state vectors does not increase the computational power of AfAs in the unbounded-error model. When focusing only the rational values

APA, Harvard, Vancouver, ISO, and other styles

29

Ohtsuki, M. "Language and thinking: a contrastive characterization of English, French, German and Russian, with its application to language pedagogy." Linguistics & Polyglot Studies 7, no. 4 (2021): 70–73. http://dx.doi.org/10.24833/2410-2423-2021-4-28-70-73.

Full text

Abstract:

This paper seeks to give in a concise manner a holistic characterization of English, French, German and Russian, revealing at the same time the types of thinking (or thought patterns) involving these languages. The four languages are characterized respectively as being experiential/pragmatic, rational/ dualistic, idealistic, and antithetical. Based on these observations, some suggestions as to the pedagogy of foreign languages are also made.

APA, Harvard, Vancouver, ISO, and other styles

30

Olson, David R. "Literacy and the languages of rationality." Pragmatics and Cognition 21, no. 3 (2013): 431–47. http://dx.doi.org/10.1075/pc.21.3.01ols.

Full text

Abstract:

Literacy, specifically the use of writing for rational purposes, adds a new dimension to the traditional problem of the relation between language, thought and rationality. Central to rational thought are the logical relations expressed by such terms as “is”, “or”, “and” and “not”. Whereas some see these concepts as fundamental and innate, it is here argued that such terms exhibit a diverse range of uses in speech and thought but through literacy and education they become explicit objects of thought and formalized or ‘normed’ into logical operators as part of a literate rationality. This more f

APA, Harvard, Vancouver, ISO, and other styles

31

AFONIN, SERGEY, and ELENA KHAZOVA. "ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES." International Journal of Foundations of Computer Science 21, no. 05 (2010): 689–704. http://dx.doi.org/10.1142/s0129054110007507.

Full text

Abstract:

The set of all regular languages is closed under concatenation and forms a monoid known as the monoid of regular languages. In this paper the structure of finitely generated subsemigroups of this monoid in case of one letter alphabet is investigated. We prove that finitely generated semigroups of regular languages over a one letter alphabet are Kleene, rational and thus automatic. It is already known that not all of finitely generated commutative semigroups are automatic, thus we may conclude that semigroups of unary regular languages have more rigid structure.

APA, Harvard, Vancouver, ISO, and other styles

32

DROSTE, MANFRED, and DIETRICH KUSKE. "Recognizable languages in divisibility monoids." Mathematical Structures in Computer Science 11, no. 6 (2001): 743–70. http://dx.doi.org/10.1017/s0960129501003395.

Full text

Abstract:

We define the class of divisibility monoids that arise as quotients of the free monoid Σ* modulo certain equations of the form ab = cd. These form a much larger class than free partially commutative monoids, and we show, under certain assumptions, that the recognizable languages in these divisibility monoids coincide with c-rational languages. The proofs rely on Ramsey's theorem, distributive lattice theory and on Hashigushi's rank function generalized to these monoids. We obtain Ochmański's theorem on recognizable languages in free partially commutative monoids as a consequence.

APA, Harvard, Vancouver, ISO, and other styles

33

Rusho, Dima. "Cultural conceptualisations of language and country in Australian Indigenous languages." International Journal of Language and Culture 5, no. 1 (2018): 94–111. http://dx.doi.org/10.1075/ijolc.17006.rus.

Full text

Abstract:

Abstract This article presents a Cultural Linguistics perspective on the enduring and multifaceted relationship between people, language and country in Indigenous Australia. It builds on a substantial body of work in Cultural Linguistics that has examined the cultural conceptualisations present in Aboriginal English, but shifts the focus to exploring how such conceptualisations are also encoded in ancestral Indigenous languages. The article provides linguistic and ethnographic data from a number of Indigenous language groups to explicate the notions of language as a ‘cultural schema’ and count

APA, Harvard, Vancouver, ISO, and other styles

34

Kudlek, Manfred, and Alexandru Mateescu. "Algebraic, Linear and Rational Languages Defined by Mix Operation." Fundamenta Informaticae 33, no. 3 (1998): 249–64. http://dx.doi.org/10.3233/fi-1998-33303.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Czaja, Ludwik, and Manfred Kudlek. "Rational, Linear and Algebraic Process Languages and Iteration Lemmata." Fundamenta Informaticae 43, no. 1-4 (2000): 49–60. http://dx.doi.org/10.3233/fi-2000-43123403.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Takahashi, Masako. "The greatest fixed-points and rational omega-tree languages." Theoretical Computer Science 44 (1986): 259–74. http://dx.doi.org/10.1016/0304-3975(86)90123-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Keesmaat, N. W., and H. C. M. Kleijn. "Net-based control versus rational control The relation between ITNC vector languages and rational relations." Acta Informatica 34, no. 1 (1997): 23–57. http://dx.doi.org/10.1007/s002360050072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Latifov, Baxriddin. "USE OF INNOVATIVE TECHNOLOGIES IN ENGLISH LANGUAGE TEACHING." CONFERENCE ON UNIVERSAL SCIENCE RESEARCH 2023 1, no. 3 (2023): 75–77. https://doi.org/10.5281/zenodo.7713662.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Choffrut, Christian. "A Note on the Logical Definability of Rational Trace Languages." Fundamenta Informaticae 116, no. 1-4 (2012): 45–50. http://dx.doi.org/10.3233/fi-2012-667.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Afonin, Sergey. "Decision Problems and Applications of Rational Sets of Regular Languages." Fundamenta Informaticae 162, no. 2-3 (2018): 101–18. http://dx.doi.org/10.3233/fi-2018-1716.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Bertoni, A., and P. Massazza. "On the inclusion problem for finitely ambiguous rational trace languages." RAIRO - Theoretical Informatics and Applications 32, no. 1-3 (1998): 79–98. http://dx.doi.org/10.1051/ita/1998321-300791.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Holzer, Andreas, Christian Schallhart, Michael Tautschnig, and Helmut Veith. "Closure properties and complexity of rational sets of regular languages." Theoretical Computer Science 605 (November 2015): 62–79. http://dx.doi.org/10.1016/j.tcs.2015.08.035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Xin, Zhang Lou. "A characterization of rational star languages generated by strong codes." Semigroup Forum 35, no. 1 (1986): 373–76. http://dx.doi.org/10.1007/bf02573118.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Huy, Phan Trung, Igor Livotsky та Do Long Van. "Which finite monoids are syntactic monoids of rational ω-languages". Information Processing Letters 42, № 3 (1992): 127–32. http://dx.doi.org/10.1016/0020-0190(92)90135-i.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

BASSINO, FRÉDÉRIQUE, LAURA GIAMBRUNO, and CYRIL NICAUD. "THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES." International Journal of Foundations of Computer Science 21, no. 04 (2010): 495–516. http://dx.doi.org/10.1142/s0129054110007398.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Bedon, Nicolas, Alexis Bès, Olivier Carton, and Chloé Rispal. "Logic and Rational Languages of Words Indexed by Linear Orderings." Theory of Computing Systems 46, no. 4 (2009): 737–60. http://dx.doi.org/10.1007/s00224-009-9222-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Margolis, Stuart W., and Jean-Eric Pin. "On varieties of rational languages and variable length codes II." Journal of Pure and Applied Algebra 41 (1986): 233–53. http://dx.doi.org/10.1016/0022-4049(86)90111-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Finkel, O., J. P. Ressayre, and P. Simonnet. "On infinite real trace rational languages of maximum topological complexity." Journal of Mathematical Sciences 134, no. 5 (2006): 2435–44. http://dx.doi.org/10.1007/s10958-006-0120-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Van, D. "Characterizations of rational ω-languages by means of right congruences". Theoretical Computer Science 143, № 1 (1995): 1–21. http://dx.doi.org/10.1016/0304-3975(95)80008-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Do Long Van, Bertrand Le Saëc та Igor Litovsky. "Characterizations of rational ω-languages by means of right congruences". Theoretical Computer Science 143, № 1 (1995): 1–21. http://dx.doi.org/10.1016/0304-3975(95)80022-2.

Full text

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!