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
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. ...
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 ...
Each row in this combinatoric table would therefore consist of the same 22 rules with either the first or the second output option, and all the rows together would present every possible combination of ...
doi:10.25088/complexsystems.20.4.375
fatcat:dwcllytpl5fjxhlssvptxhrvfe
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
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
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
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. ...
Rice, The average height of planted plane trees (pp. 15-22); Solomon W. Golomb, How to number a graph (pp. 23-37); Frank Harary and Allen J. ...
Subject 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 2019; you can also visit the original URL.
The file type is application/pdf.
I3
theorem
3 13
rank
22, 128. 166
hyperedges of _
12x
local N
460
local funny _
460
Rae result on regular interative arrauys
232
Raoult and Kennaway
673
rapid prototyping
I2
rates ...
SO I
213, 302,402,489,
577,603,668.697
recognition
709
control
35, 49, 625, 640, 773
sets 405, 420
automata
625
tree languages
4 IS
automata, finite state -625
context-freeness
problems ...
doi:10.1016/0304-3975(95)80002-6
fatcat:azbu2orp7vc75pwux4jxnvxl7m
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. ...
Sportelh, A generalization of Sardinas and Patterson's algorithm to z-codes 108 (2) (1993) David Michael Ritchie Park (1935 -1990 in memoriam (Obiruary) 133 (2) (1994) 143 (1) (1995) ...
doi:10.1016/0304-3975(95)90003-9
fatcat:nu4xbvgzrvbfvicemt4sviortu
Cumulative index volumes 1–100
1992
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.
., Equivalence
of infinite behavior of finite automata
Alder, A. and V. ...
reduction
method"
(Note)
I1 (3) (1980) 341
Cumula~ivelndex Volumes l-100
Benedek, G.M. and A. ...
doi:10.1016/0304-3975(92)90292-n
fatcat:ekwes6owtrco3lkfkiqagnketq
Page 1670 of Mathematical Reviews Vol. 54, Issue 5
[page]
1977
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 22 (1977), no. 1, 17-30. ...
The first volume describes: the motivation for the choice of PL/i (in fact a modification of a subset is chosen), the reason for the choice of compilation method (which is a mixed one: for analysis and ...
Subject index volumes 1–200
1999
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.
1255 Seiferas, -and Meyer, 532 Fisher and Kasteleyn, Pfaffian technique of -, 262 fitness to Petri net languages, 3 10 ,3209
2-D alternating -, 2393
finite automata, acceptance
by -1476
of m-languages ...
Index Volumes I-2OO/Theoretical
Computer Science 213/214 (1999) 5-436
time and space complexity, 616, 624, 1155
classes, 773
time bound, 2162.2395
subexponential -, 2668
time bounded
automata, ...
doi:10.1016/s0304-3975(98)00319-3
fatcat:s22ud3iiqjht7lfbtc3zctk7zm
Languages of lossless seeds
2014
Electronic Proceedings in 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 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We prove that lossless seeds coincide with languages of certain sofic subshifts, hence they can be recognized by finite automata. ...
Moreover, we show that these subshifts are fully given by the number of allowed errors k and the seed margin l. ...
The author is supported by the ABS4NGS grant of the French government (program Investissement d'Avenir). He is grateful to Gregory Kucherov and Karel Klouda for helpful ideas. ...
doi:10.4204/eptcs.151.9
fatcat:bmbsqrasa5fezdrhmuhtwxy54i
« Previous
Showing results 1 — 15 out of 359 results