To Some Structural Properties Of ∞-languages

Authors

  • Ivan Mezník Institute of Informatics, Faculty of Business and Management, Brno University of Technology, Kolejní 2906/4, 612 00 Brno, Czech Republic

DOI:

https://doi.org/10.23755/rm.v42i0.721

Abstract

Properties of catenation of sequences of finite (words) and infinite (  lengths are largely studied in formal language theory. These operations are derived from the mechanism how they are accepted or generated by the corresponding devices. Finite automata accept structures containing only words, automata accept only words. Structures containing both words and words (∞ - words) are mostly generated by various types of ∞ - automata(∞- machines). The aim of the paper is to investigate algebraic properties of operations on ∞ - words generated by IGk –automata, where k is to model the depth of memory. It has importance in many applications (shift registers, discrete systems with memory,…). It is shown that resulting algebraic structures are of „pure“ groupoid or partial groupoid type.

References

J. Chvalina, Š. Hošková-Mayerová, General ω- hyperstructures and certain applications of those, Ratio Mathematica 23, 3-20(2012)

Z. Grodzki, The k – machines, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys., Vol. XVIII, 7, 541-544(1970)

M. Juráš and I. Mezník, On IG – languages, Mathematics University of Oulu(1992)

W. Kwasowiec, Generable sets, Information and Control 17, 257-264(1970)

M. Linna, On ω-sets associated with context-free languages, Inform. and Control 31, 273-293(1976)

R. McNaughton, Testing and generating infinite sequences by a finite automaton. Inform. and Control 9, 521-530 (1966)

I. Mezník, On a subclass of ∞ - regular languages, Theoretical Computer Science 61, 25-32(1988)

I. Mezník, On some structural properties of a subclass of ∞ - regular languages, Discrete Applied Mathematics 18, 315-319(1987)

D.E. Muller, Infinite sequences and finite machines, In: IEEE Proc. Fourth Ann. Symp. On Switching Theory and Logical Design, 3-16(1963)

M. Nivat, Infinite words, infinite trees, infinite computations, In: J. W. De Bakker and J. Van Leeuwen, eds., Foundations of Computer Science III (Mathematisch Centrum, Amsterdam), 5-52(1979)

M. Novotný, Sets constructed by acceptors, Inform. and Control 26, 116-133(1974)

Z. Pawlak, Stored program computers. Algorytmy 10, 7-22(1969)

D. Perrin, An introduction to finite automata on infinite words, Lecture Notes in Computer Science 192, 2-17(1984)

A. Skowron, Languages determined by machine systems, , Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys., Vol.XIX,4,327-329(1971)

L. Staiger, Finite-state ω – languages, J. of Comp. And Syst. Sci. 27, 434-448(1983)

Downloads

Published

2022-06-30

Issue

Vol. 42 (2022)

Section

Volume 42-2022

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.