A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Publication List of Zoltán Ésik
2017
Acta Cybernetica
Preserved Fulltext
On the structure of free iteration semirings.
Journal of Automata, Languages and Combinatorics, 19(1-4):57-66, 2014.
[9] ZoltánÉsik. ...
Homomorphic simulation and Letichevsky's
criterion. Journal of Automata, Languages and Combinatorics, 6(4):427-436,
2001.
[64] ZoltánÉsik and Werner Kuich. ...
doi:10.14232/actacyb.23.1.2017.23
fatcat:tpgf7t2sgfdsriwvebwyce3lr4
Curriculum Vitae of Zoltán Ésik
2017
Acta Cybernetica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other conference and seminar presentations Talks at cca. 80 international conferences and workshops. ...
Seminar and/or colloquium presentations at the following universities and research centers (several talks at some places): ...
Editorial Work Member of the Editorial Board of: Journal of Automata, Languages and Combinatorics (2016) , 2005-2007, 2002-2004, 1994-1996. 5 , Journal of Mathematics and Computer Science (2009- ...
doi:10.14232/actacyb.23.1.2017.22
fatcat:23vz5jef6rflzftjmtlztnxsoa
The influence of Imre Simon's work in the theory of automata, languages and semigroups
2019
Semigroup Forum
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The purpose of this tribute is to review three major results due to Simon that had a considerable influence on the development of automata and semigroup theory. ...
Acknowledgements I would like to thank László Márki and Norman Reilly for their help during the preparation of this article. ...
Imre Simon's work had a tremendous impact on subsequent research and considerable influence in semigroup theory, automata, formal languages, combinatorics on words and finite model theory. ...
doi:10.1007/s00233-019-09999-8
fatcat:ebozes2olbddliniyrteshre4m
Page 476 of Computational Linguistics Vol. 30, Issue 4
[page]
2004
Computational Linguistics
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Schulz, Klaus U. and Stoyan Mihov. 2002. Fast string correction with Levenshtein-automata. International Journal of Document Analysis and Recognition, 5(1):67-85.
Seni, Giovanni, V. ...
Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
Kim, Jong Yong and John Shawe-Taylor. 1992. An approximate string-matching algorithm. ...
Page 1467 of Mathematical Reviews Vol. 52, Issue 4
[page]
1976
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Formal Languages, Second (Kaiserslautern, 1975) "9658 Graphs and combinatorics (Proc. ...
Hamaker 9520a
Collection of articles in memory of Jurii Viadimirovit Linnik 8033
Collection of articles on social choice 9985
Collection of papers on cellular automata and developmental systems (Conf. ...
Master index volumes 111–120
1993
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Jantzen, Editorial to the Special Issue of Selected Papers of the 8th Annual Symposium on .-M. and K. Musumbu, Type inference in Prolog: a new approach 119 (1) (1993) 23-38 Cousot, P. and R. ...
Leroux, Foreword to the Special Issue of Selected Papers of the Conference on Formal Power Series and Algebraic Combinatorics, methods of declarative properties of definite programs (Fundamental Study) ...
doi:10.1016/0304-3975(93)90297-7
fatcat:iseijt6oo5ed5drc4sco5bmsqq
Interview with Volker Strehl
2021
Enumerative Combinatorics and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
His research interests include Enumerative Combinatorics, Mathematical Methods in Computer Science (Complexity Analysis of Algorithms, Automata, Grammars, and Formal Languages, Information and Coding Theory ...
of the editorial board of the Electronic Journal of Combinatorics for many years. ...
(though not combinatorics), automata and formal languages, information and coding theory, complexity of algorithms, cryptography, computer algebra). ...
doi:10.54550/eca2022v2s3i10
fatcat:f22lzrwlcvghjoj74yhx7y6gsq
Page 1089 of Mathematical Reviews Vol. , Issue 96b
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
results of alternating finite automata with coun- ters and stack-counters (8-14); Akira It6, Katsushi Inoue and Itsuo Takanami, Optimal simulation of two-dimensional alternat- ing finite automata by three-way ...
geometry and Davenport-Schinzel sequence (65-78); Yoshiyasu Ishigami, Ex- tremal problems and Ramsey properties of ball, box or orthant containing many points in R’—and combinatorics of permuta- tions ...
THE EKATERINBURG SEMINAR "ALGEBRAIC SYSTEMS": 50 YEARS OF ACTIVITIES
2017
Ural Mathematical Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The aim of the present article is to give a characterization of distinctive features of the scientific seminar founded and led by the author as well as to show the main sides of its activities during half ...
Eilenberg (1976) in the volume B of his well-known monograph "Automata, Languages and Machines". The classification (i)-(x) is rather conditional: there are no clear-cut borders between these lines. ...
functions (a separate chapter), finite automata and regular languages (a separate chapter). ...
doi:10.15826/umj.2017.1.008
fatcat:4gtctbvp4vgolannh3dcu5cyxi
From Meander Designs to a Routing Application Using a Shape Grammar to Cellular Automata Methodology
2011
Complex Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The usefulness of a methodology that integrates shape grammar for capturing design information with cellular automata for computational output of a design solution space is demonstrated in this paper. ...
System architectures addressing an underground heating specification are automatically generated and evaluated, resulting in a group of design alternatives displaying the best piping layouts for the given ...
mainly attributable to von Neumann [23, 24, pp. 79-82] , Ulam and Zuse [25] , and Wiener and Rosenblueth [26] . ...
doi:10.25088/complexsystems.20.4.375
fatcat:dwcllytpl5fjxhlssvptxhrvfe
Page 1442 of Mathematical Reviews Vol. 48, Issue 5
[page]
1974
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A King, A graph-theoretic programming language (pp. 63- 75); W. Kuich, Entropy of transformed finite-state auto- mata and associated languages (pp. 77-86); W. F. ...
COMBINATORICS
14a
*Graph theory and computing. 8280 Including part of the proceedings of a conference held at the University of the West Indies, Kingston, Jamaica in January, 1969. ...
Elicitation of Non-functional Requirement Preference for Actors of Usecase from Domain Model
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Area of Specializations
: Formal Languages and Automata Theory
7. ...
Iso-Array Grammars and Picture Languages, International Journal of Mathematical Sciences, Volume
6, No.3-4,375-390,2007.
5.Arrays, Special sub arrays and computation, International Journal of Applied ...
doi:10.1007/11961239_23
fatcat:dg6msn5xebaofl37ixdcxmhpam
The Insertion Encoding of Permutations
2005
Electronic Journal of Combinatorics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Applications of the insertion encoding to the evaluation of generating functions for classes of permutations, construction of polynomial time algorithms for enumerating such classes, and the illustration ...
We introduce the insertion encoding, an encoding of finite permutations. Classes of permutations whose insertion encodings form a regular language are characterized. ...
The book, Combinatorics of Permutations by Miklos Bóna [7] provides a useful introduction to this area, and Volume 9(2) of the Electronic Journal of Combinatorics contains a wide variety of research ...
doi:10.37236/1944
fatcat:ehaucmgolnhnpdmx53pjqtytiq
Cumulative index volumes 101–150
1995
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
., Foreword to the Special Issue of Selected Papers of the Second International
Colloquium
on
Words, Languages and Combinatorics.
Kyoto, Japan, August 25-28, 1992 134 (1) (1994) 1
Ito, M. and G. ...
M., Foreword to the Special Issue on Selected Papers of the International
Colloquium
on Words,
Languages and Combinatorics.
Kyoto. Japan. August 28-31, 1990 108 (1) (1993) 1
Ito, A., see K. ...
Sarrafzadeh 140 (2) (1995) 23 l-247 Madlener. K., P. Narendran, F. Otto and L. Zhang, On weakly confluent monadic string-rewriting systems 113 (1)(1993) 119-165 Madonia, M., S. Salemi and T. ...
doi:10.1016/0304-3975(95)90003-9
fatcat:nu4xbvgzrvbfvicemt4sviortu
Page 387 of Mathematical Reviews Vol. 51, Issue 1
[page]
1976
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Sympos., No. 9, 1972) 222 Combinatorics, Part 1 194 Combinatorics (Proc. Conf., Oxford, 1973) 172
Commemoration volumes for Prof. Dr. ...
Perugia, 1970) 179, 1697 Automata, languages and programming (Proc. Sympos., Rocquencourt, 1972) 2355, 2686 Automatentheorie und formale Sprachen (Bericht Tagung Math. ...
« Previous
Showing results 1 — 15 out of 374 results