Families of R-fuzzy Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)
Section A Algebraic & Constructive Theory of Machines, Computations and Languages
KeywordsRegular Language Monoidal Category Bottom Element Converse Inclusion Monoidal Functor
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- S. Eilenberg, Automata, Languages, and Machines. Vol. A. Academic Press, New York and London, 1974Google Scholar
- J. Brunner and W. Wechler, On behaviour of R-fuzzy automata. In Lecture Notes on Computer Science, vol. 45, 210–215, 1976Google Scholar
- S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland Publ. Comp., Amsterdam and Oxford and American Elsevier Publ. Comp., Inc., New York, 1975Google Scholar
- S. Mac Lane, Kategorien. Springer-Verl. Berlin, Heidelberg, New York, 1972Google Scholar
- P. Turakainen, The family of stochastic languages is closed neither under catenation nor under homomorphism. Ann. Univ. Turku, Ser. A, 133, 1970Google Scholar
- W. Wechler, The concept of fuzziness in the theory of automata. In ‘Modern Trends in Cybernetics and Systems’ (Eds. J. Rose and C. Bilciu). Springer-Verl. Berlin, Heidelberg and New York, 1977Google Scholar
- W. Wechler, A. hierarchy of n-rational languages. TU-Preprint 07-16-76, 1976Google Scholar
© Springer-Verlag Berlin Heidelberg 1977