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
On the structure of free iteration semirings. Journal of Automata, Languages and Combinatorics, 19(1-4):57-66, 2014.  ZoltánÉsik. ... Homomorphic simulation and Letichevsky's criterion. Journal of Automata, Languages and Combinatorics, 6(4):427-436, 2001.  ZoltánÉsik and Werner Kuich. ...doi:10.14232/actacyb.23.1.2017.23 fatcat:tpgf7t2sgfdsriwvebwyce3lr4
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
Ablayev, On comparing probabilistic and deterministic automata complexity of languages (pp. 599-605). ... Saoudi, Pushdown automata on infinite trees and omega-Kleene closure of context- free tree sets (pp. 445-457); Erik M. Schmidt and Michael I. ...
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
and formal languages theory. ... The work- shop focused on both the practical and the theoretical aspects of using partial order models, including automata and formal languages, category theory, con- currency theory, logic, process algebra ...
The theory of automata and formal languages developed afterwards has led to the definition of automatic sequences; A. ... Chapter 15 introduces a measure of the au- tomaticity of a language, approximating formal languages by reg- ular languages, and also the notion of quasi-automaticity. ...
This volume collects together extended and improved versions of papers presented at the twentysecond Workshop on Logic, Language, Information and, Computation (WoLLIC 2015) held at the School of Informatics ... Contributions were invited on all appropriate subjects of Logic, Language, Information, and Computation, with particular interest in cross-disciplinary topics. ... Lapok (Journal of Applied Mathematics), Algebra, Journal of Automata, Languages and Combinatorics, and former member of many other editorial boards. ...doi:10.1017/s0960129518000373 fatcat:nayksjkb5jctzd4rupvwk2brtm
This area is related to several other branches of mathematics, such as number theory, group theory, probability theory, and theoretical informatics, as well as automata or formal language theory. ... Each chapter is concerned with a particular aspect of combinatorics on words, except the first one which contains definitions and basic results used in the rest of the volume. ...
The rest of the book, Chapters 8-11, deals with specific problems, each worthy of a complete volume. ... Combinatorial problems on words arise in areas as far apart as pure mathematics and contemporary applied mathematics (especially theory of automata and formal languages). ...
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 ... A simple and versatile approach for achieving such computing with shapes is shape grammar, developed by Stiny and Gips  and based on formal languages as defined by the work of Chomsky  . ...doi:10.25088/complexsystems.20.4.375 fatcat:dwcllytpl5fjxhlssvptxhrvfe
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
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. ... For the encyclopaedia , a team consisting of Koryakov, Shevrin, Volkov, and Zamyatin prepared 11 papers: Code, Finite Automaton, Pushdown automaton, Variety of Rational Languages, Rational Language ...doi:10.15826/umj.2017.1.008 fatcat:4gtctbvp4vgolannh3dcu5cyxi
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. ...
of automata and semigroups. ... The first two chapters deal with combinatorics on words: Lyn- don words, factorial languages and subword complexity, Ramsey’s and Shirshov’s theorems, power-free words and bi-ideal sequences. ...
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  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
« Previous Showing results 1 — 15 out of 436 results