Citation of
A T
Jorge
Almeida, Angela
Cardoso
A Sequence of
Weakly Monotonic Automata with Increasing Level
Int. J. Algebra,
7 ( 2), 91 – 100, 2013
300 Kouji Yano
Random
Walk in a Finite Directed Graph Subject to a Road Coloring
J.
Theoret.. Probability, 26( 1) , 2013, 259-283
Norman
R. Reilly
Regular principal factors in free objects in Rees-Sushkevich varieties
Semigroup
Forum 86( 1), 162-182, 2013
M.V. Sapir
Non-commutative combinatorial algebra
math.vanderbilt.edu,
2013
Independent sets of words and the synchronization problem
Advances
in Applied Mathematics, V 50( 3), 339-355, 2013
Ed
Dubinsky , Robin T. Wilson
High school students’ understanding of the function concept
J.
of Mathematical Behavior . 32 ( 1),
2013, 83–101
Dmitry S. Ananichev,
Primitive digraphs with large exponents
and slowly synchronizing automata
(Примитивные
орграфы с
большими
экспонентами
и медленно синхроизируемые
автоматы)
Zapiski Nauchnyh
Seminarov POMI [Komb. Teorija Grafov. IV], 402, 9-39 (2012).
Krieger, Wolfgang ; Weiss,
Benjamin
Sofic random processes
J. REINE UND
ANGEW. MATH 671, 31-47,
2012
Igor
Podolak
Klasyfikator Hierarchiczny
Wyd. Uniw. Jagiellońskiego,
Minimal non-finitely based semigroups
Sem. Forum, 3(85),
577-580, 2012
Lee Edmond
W. H
A
sufficient condition for the non-finite basis property of semigroups
Monatshefte Math.
V.168, I. 3-4, 2012, 461-472
290. Dolinka, Igor
INTERNATIONAL
Reviewer:Peter R. Jones ZBL 1234*20064, 2012
Dolinka, Igor
On free spectra of
locally testable semigroup varieties.
Glasg. Math.
J. 53, No. 3, 623-629 (2011).
Lee Edmond W. H
A
sufficient condition for the non-finite basis property of semigroups
Monatshefte Math.
V.168,
Lee,
STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 49( 3),: 366-389
Jane Chandlee, Jie Fu, Konstantinos Karydis, Cesar Koirala, Jeffrey Heinz, Herbert Tanner
Integrating
Grammatical Inference into Robotic Planning
The 11th ICGI
JMLR, Conf. Proc. 21(2012)
69–83.
Vladimir V. Gusev
Synchronizing
Automata of Bounded Rank
CIAA 2012,
LNCS, 7381(2012), Impl. Appl. of
Automata, 171-179
Fedor Fominykh, Mikhail Volkov
Playing for
Synchronization
CIAA 2012,
LNCS, 7381(2012), Impl. Appl. of
Automata, 159-170
Pavel V. Martyugin
Synchronization
of Automata with One Undefined or Ambiguous Transition
CIAA 2012,
LNCS, 7381(2012), Impl. Appl. of
Automata, 278-288.
Mikhail V. Berlinkov
Synchronizing
Automata on Quasi-Eulerian Digraph
CIAA 2012,
LNCS, 7381(2012), Impl. Appl. of
Automata, 90-100
Galina Jirásková ,
Tomáš Masopust
On the
State and Computational Complexity of the
Reverse of
Acyclic Minimal DFAs
CIAA
2012, LNCS, 7381(2012), Impl. Appl. of
Automata,. 229–239.
280. Trahtman A.N.
An algorithm for road
coloring.
J. Disc.
Reviewer:
Alfredo Donno, MR2884814 (2012)
Kouji Yano, Kenji Yasutomi
Realization of an ergodic Markov chain as a
random walk
subject to a synchronizing road coloring.
J. Appl. Probab. 48(2011), 3, 766–777.
Finite Basis
Problem for Semigroups of Order Five or Less:
Generalization
and Revisitation
Studia Logica, 2012
Kudłacik, R. Roman, A.
Wagner, H.,
Effective
Synchronizing Algorithms
Expert Syst.
Appl., 39 (14), 11746-11757, 2012
V.Yu. Protasov,
A.S. Voynov
Sets of
nonnegative matrices without positive products
Linear Alg.
& Appl., 437
(3), 749-765, 2012
Igor T. Podolak, Adam Roman, Dariusz Jędrzejczyk
Application of
Hierarchical Classifier to Minimal Synchronizing Word Problem
AISC, LNCS
7267(2012), 421-429
Trahtman A.N.
Some new
Features and Algorithms for the Study of DFA
Open J. Discr. Math., 2(2), 2012, 45-50
Jean Berstel, Clelia De Felice, Dominique Perrin,
Christophe Reutenauer, Giuseppina Rindone
Recent results
on syntactic groups of prefix codes
Europ. J. Comb.,
33(7), 1386-1401, 2012
Raphaël M. Jungers
The
Synchronizing Probability Function of an Automaton
Adam Roman
P–NP Threshold
for Synchronizing Road Coloring
Language and
Automata Theory and Applications, LNCS 7183(2012), 480-489
270. G. Mashevitzky
Bases of
identities for semigroups of bounded rank transformations of a set.
Khoury, Raphaël / Tawbi, Nadia
Which security
policies are enforceable by runtime monitors? A survey
Comput. Sci. Review, 6
(1), 27-45, 2012
Reviewer:
Marcel G. Jackson,
MR2851972(2012)
Zhang, Wen Ting(PRC-LAN); Luo, Yan Feng(PRC-LAN)
A new example
of a minimal nonfinitely based semigroup.
Bull. Aust.
Math. Soc. 84 (2011), no. 3, 484–491.
Kouji Yano
Random Walk in
a Finite Directed Graph Subject to a Road Coloring
J. Theor. Probability, 2012
Science.gov, v.5.0, 2011
Wen
Ting Zhang and Yan Feng
Luo
The Variety Generated by All Non-Permutative and Non-Idempotent
Semigroups of
Order Four.
Proc. The Int. Conf.
Algebra 2010: Indonezia, World Sci. (2011), 721-735.
Brian Marcus.
Symbolic
Dynamics. Math. of Complexity and Dynamical
Systems. 2011,
1689-1710.
E. W. H. Lee, Jlan Rong Li
Minimal
non-finitely based monoids
Diss. Math. ( ROZPRAWY MATEMATYCZNE)
475, Warshawa, 2011, 65
Wen Ting Zhang,
Yan Feng Luo
A new example
of a minimal nonfinitely based semigroup
Bull. of the Austr. Math. Soc.,
3(84), Cambr. Univ
Press, 2011, 484-491
MV Volkov, SV Goldberg, and SI Kublanovsky
A MINIMAL NONFINITELY
BASED SEMIGROUP WHOSE VARIETY
IS POLYNOMIALLY
RECOGNIZABLE
J.
of Mathematical Sciences,. 6(177), 2011, 847-859
I. Dolinka
On free Spectra of Locally
Testable Semigroup Varieties
260 V Kouji Yano
and Kenji Yasutomi
Realization of
an ergodic Markov chain as a random walk subject
to a synchronizing
road coloring.
J. Appl. Probab. V. 48, 3 (2011), 766-777.
ladimir V. Gusev
Lower Bounds
for the Length of Reset Words in Eulerian Automata
Lect. Notes in Comput, Sci., 6945(2011), Reachability Problems, 180-190
E. W. H. Lee
A sufficient
condition for the non-finite basis property of semigroups
Monatshefte für Mathematik, 2(83),
2011 250-280
Trahtman A.N.
An Algorithm
for Road Coloring.
Lect. Notes in
Comp. Sci, Springer, 7056 (2011), Springer, 349--360
Ishanu Chattopadhyay, Yicheng Wen, Asok Ray, Shashi Phoha
Unsupervised
Inductive Learning In Symbolic Sequences via Recursive
Identification
of Self-Similar Semantics.
American
Control
М. В. Берлинков
О
погрешности
полиномиального
вычисления
оптимальной
раскраски графа в синхронизируемый автомат
(On the error
of polynomial computations of optimal
graph coloring in a
synchronized automaton)
Прикл. дискр мат. (Appl. disc. math.)
2011, №
2, 49–72
Benjamin
Steinberg
The Černý conjecture for one-cluster automata with prime
length cycle.
Theoret. Comput.,
Sci., 412(39), 5487-5491, 2011
B. A. Davey, M.
G. Jackson, J. G. Pitkethly and C. Szabó
Finite degree: algebras
in general and semigroups in particular
Semigroup
Forum, V. 83, 1(2011), 89-110
Simon M. Goberstein
Lattice isomorphisms of bisimple
monogenic orthodox semigroups
Semigroup
Forum, 2011, 2(83), 250-280
Trahtman A.N.
Modifying the
upper bound on the length of minimal synchronizing word.
Lect. Notes in Comp. Sci,
Springer, 6914(2011), 173-180
250. Lee EWH, Volkov MV
Limit Varieties generated by completely
0-simple Semigrouos
Int. J. of
Luo, Yanfeng / Zhang, Wenting,
On the variety
generated by all semigroups of order three
J. of Algebra, 334(1), 1-30, 2011
Beal MP, Berlinkov MV, Perrin D
A QUADRATIC UPPER BOUND ON THE SIZE OF A
SYNCHRONIZING WORD
IN ONE-CLUSTER
AUTOMATA
Int. J Found. Comput. Sci.
22(2), 277-288, 2011
Songs to syntax: the linguistics of birdsong.
Trends in
Cognitive Sciences, V 15, I 3, 113-121, 2011
K.Chmiel, A.Roman
COMPAS - A Computing Package for
Synchronization
LNCSImpl. and Appl. of Automata, , 6482(2011), 79-86 2011
The generalized road coloring problem and periodic
digraphs
Applicable Algebra in Engineering, Communication and
Computing, 2011
V 22, N 1, 2011, 21-35
E.W.H. Lee
Finite
basis
problem for 2-testable monoids
Centr. Eur. J. of
Math,.
Vol. 9, N 1, 2011, 1-22
Goran Hognas, Arunava Mukherjea
Probability Measures
on Semigroups
Convolution Products, Random Walks and Random Matrices
Probability and
Its Applications, Springer, 2011, 1-62
Roman,
Adam
The
NP-completeness of the Road Coloring Problem
Information Processing Letters, 111 (7), .342, 2011
Kudryavtseva
G.
Ordered semigroups, upper-triangular
reflexive relations and semigroups of languages.
IJAC 6, 20(2010), 823–832.
240.
Roman A.
Experiments on
Synchronizing Automata
Schedae Informaticae, Versita,
MV Volkov, SV Goldberg S. I. Kublanovsky
A minimal nonfinitely based semigroup whose variety is polynomially recognizable
(М. В. ВОЛКОВ, С.
В. ГОЛЬДБЕРГ, С. И.
КУБЛАНОВСКИЙ
Минимальная
бесконечно
базируемая
полугруппа
с полиномиально
распознаваемым
многообразием)
Фунд. и прикл.мат., 16, 3(2010), 105—122.
RM Jungers
The synchronizing probability function of an automaton
JM2010 .
LNCS, 6072:37–47, 2010.
M. Jackson and
M. Volkov
The Algebra of Adjacency
Patterns: Rees Matrix Semigroups with Reversion
Fields of Logic
and Computation
LNCS Volume 6300( 2010), 414-443,
Benjamin
Steinberg
A Theory of
Transformation Monoids:
Combinatorics and
Representation Theory
The Electronic
Journal of Combinatorics, v.17,
i. 1,
2010, 3-56
Arturo Carpi, Flavio D'Alessandro
Locally
strongly transitive automata and the Hybrid Cerny-Road
coloring problem
12-th ICTCS,
James Rogers,
Jeffrey Heinz, Gil Bailey, Matt Edlefsen and Molly Visscher, et al.
On Languages
Piecewise Testable in the Strict Sense
LNCS,
6149(2010), MOL,
255-265
Dmitry Ananichev, Vladimir Gusev,
Mikhail Volkov
Slowly
Synchronizing Automata and Digraphs
LNCS
6281(2010), MFCS 2010, 55-65
Graph Coloring:
Four Color Theorem, Acyclic Coloring, List Coloring, Chromatic Polynomial, Equitable Coloring,
Hadwiger Conjecture
Life Journey
2010, 170
Israeli
Mathematicians: Adi Shamir, Giulio
Racah, Saharon Shelah, Zlil Sela,
Robert Aumann,
Michael O. Rabin, Oded Schramm, Avraham Trahtman
Books LLC, 176,
2010
230 Yuri. Gulak,
On Elementary and Algebraic Cellular Automata
Unifying Themes in Complex Systems, Proc.of the
Sixth Int. Conf., P.1,
Factorial, Binomial Coefficient, Combinatorics, Permutation,
Combination,
Pigeonhole Principle, Catalan's Constant
Books LLC,
Barnes & Noble, 612, 2010
I. Woungang, S. Misra and S. Chandra
Misra
Selected Topics in Information and Coding Theory
Series on
Coding Theory and Cryptology, v. 7, World Scientific, Singapore, 2010
Automata Theory: Finite- State Machine,
Regular Expression, Pushdown Automaton,
Star Height
Problem, Tree Automaton, Sequential Logic,
Books LlC, 290, 2010
Mathematics and
Culture: Leonardo Da Vinci, Arcadia, Magic Square,
Mathematical Folklore, Danica
Mckellar, Proof, Mathematics and Art, Numbers
JEAN
BERSTEL, DOMINIQUE PERRIN, CHRISTOPHE REUTENAUER
Cambridge
University Press, 2010, 620
Lambert M Surhone, Miriam T. Timpledon,
Susan F Marseken
VDM Verlag Dr. Mller AG & Co. Kg, 2010, 76
On a Conjecture by Carpi and D'Alessandro
Developments
in Language Theory, Springer, NY,
The Averaging Trick and the Cerny
Conjecture
-
Developments in Language Theory, Springer, NY,
On
the Hybrid Cerny-Road Coloring Problem and Hamiltonian Paths
-
Developments in Language Theory, Springer, NY,
A Mathematical Medley: Fifty Easy Pieces on
Mathematics
A Partially Synchronizing Coloring
CSR-2010, Lecture Notes in
Computer Science 6072, Springer, 2010, 362-370
Trahtman
A.N., Bauer T., Cohen N.
Linear visualization of a Road
Coloring.
9th Twente workshop on graphs and Comb. Optim.,
Cologne 2010, 13-16
Synchronizing Coloring Of A Directed Graph
Proc. of the IMECS 2010, Hong Kong,, Vol III, 1-5
Gary Chartrand, Linda Lesniak, Ping
Zhang
Graphs & Digraphs, Fifth
Edition
group, Chapman & Hall , 2010, 480p.
An
approach to road coloring problem based on vector spaces.
(Подход
к задаче
раскраски
дорог, основанный
на векторных
пространствах
ZVESTIYA
VYSSHIKH UCHEBNYKH ZAVEDENII Math., 2010, N 1, 10–15
The
threshold of avoidance of partially monotonic automata
(Порог
аннуляции
для частично
монотонных автоматов)
IZVESTIYA
VYSSHIKH UCHEBNYKH ZAVEDENII Math
2010, N 1, 1–9
A
Theory of Transformation Monoids: Combinatorics and Representation Theory
ELECTRON.
J. COMB. V 17(1), 2010, 3-56
Meena Mahajan, B. V. Raghavendra Rao
Small-space
analogues of Valiant's classes
FCT'09,
Proceedings of the 17th int. conf, on Fund.. comput. theory
Springer-Verlag
Berlin, Heidelberg , 2009
The
longest haplotype reconstruction problem revisited
Symbolic
Dynamics. Encyclopedia of Complexity and Systems Science
Springer, New York, 2009, 8888-8910
Complexity
of problems concerning reset words for some partial cases of automata
Acta Cybernetica , V 19, Issue 2, 2009 , 517-536
Arturo
Carpi, Flavio D’Alessandro
Strongly transitive automata and the Cerny conjecture
Acta
Informatica, V 46, 8(2009), 591-607.
The
averaging trick and the Cerny conjecture
Trans. Amer. Math. Soc. 361 (2009), 1429–1461.
A. Bogomolny, The Lighter Side of
Mathematics,
R.K Guy and R.E.Woodrow,
eds. 2009
Shortest
synchronizing strings for Huffman codes
Theoretical
Computer Science, 410 (38), 3925-3941, 2009
COMBINATORIAL
REES–SUSHKEVICH VARIETIES THAT ARE CROSS,
FINITELY
BASED, OR SMALL
- Bulletin of the Australian Mathematical Society, 2009
James
Rogers, Jeffrey Heinz, Gil Bailey, Molly Visscher, David Wellcome,
Matt
Edlefsen, and Sean Wibel.
On
Languages Piecewise Testable in the Strict Sense.
Proceedings
of the 11th Meeting of the Association of Math.of Language. 2009
WAY
BACK FROM ANYWHERE: EXPLORING THE ROAD COLORING CONJECTURE,
Mathematics
and Computer Education. 01, 2009.
Israel
Journal of Math. , 172(1), 51-60, 2009
Jurgen
Bang-Jensen, Gregory Gutin
Digraphs: Theory, Algorithms and Applications.
Springer
Monographs in Mathematics, 2-nd edition, 2009
Decision
Version of the Road Coloring Problem is NP-complete,
190. Shevrin
L.N., Vernikov B.M., Volkov M.V.
Lattices
of semigroup varieties
IZVESTIYA
VYSSHIKH UCHEBNYKH ZAVEDENII, MAT.
J.
Berstel, D. Perrin, C. Reutenauer
Genetic
Algorithm for Synchronization
LNCS 5457, 684-695, 2009
A
class of inherently nonfinitely based semirings
Algebra Univ., 60(1), 19-35, 2009
Shades
of orthodoxy in Rees-Sushkevich varieties
SEMIGROUP
FORUM V 78 1, 157-182, 2009
Geometric and probabilistic structures in dynamics:
Contemporary
Mathematics V. 469, 2008, 70-96
Computational
Linguistics: Language Learning
On
Elementary and Algebraic Cellular Automata
Unifying themes in Compl. syst., Proc of 6-th conf, NECS,
Synchronizing
automata and the Černý conjecture
Language and automata theory and applications,
2008 - Springer
Synchronizing
Automata and the Road Coloring Theorem
Russian-Indian Workshop on Algebra, Combinatorics and Complexity
(a
satellite workshop of the 3rd International Computer Science Symposium in
Russia),
Synchronizing
Strongly Connected Digraphs
AutoMathA
Brainstorming and Cooperation Days, Wroclaw, Poland, 2008
Varieties
generated by completely 0-simple semigroups.
J.
Aust. Math. Soc. 84 (2008), no. 3, 375--403.
Road
Coloring Problem. Implementation and Visualization of the Algorithm.
Proc.
of AMS-SMS joint meeting, Shanghai, 2008, 109-110.
completely
0-simple semigroups.
Glasgow
Math. J., 49, 1:, 93-98, 2007, 20M07(08B20)
Chromatic
Graph Theory
series DISCR. MATH.
& ITS APPL., CRC Press, 2008
Springer,
LNCS 5196, 11-27, 2008
Open
Problems in Symbolic Dynamics
Geom.
& prob. struct. In dynamics: CONT. MATH. SER. v. 469, 69-118, 2008
Varieties
generated by completely 0-simple semigroups
J.
of the Australian Math. Soc., Cambridge Univ Press - 84, 375-403, 2008
Lee
EWH, Reilly NR
Centrality in Rees-Sushkevich varieties
Algebra
Universalis, 2(58), 2008
Groups
whose geodesics are locally testable.
J. ALG. AND
COMPUT. V. 18 Issue: 5
911-923, 2008
M.P.Beal,
J.Berstel, B Marcus, D Perrin, Christophe Reutenauer, Paul H. Siegel
Length Codes and Finite Automata
Information
and Computation. v. 206, Iss. 9-10.1033-1044, 2008.
5-th
IFIP WCC-TCS, Springer, , 43-53, 273(2008).
Milano, ITALY, INT. FED. FOR INF. PROCESSING
Shortest
Synchronizing Strings for Huffman Codes.
LECT.
NOTES IN COMPUT. SCI. 120--131, MFCS 2008, 5162(2008)
Talhi,
C. / Tawbi, N. / Debbabi, M.
Semigroup
Forum, 76(1), 87-94, 2008
Sharan,
G.; Beysens, D.; Milimouk-Melnytchouk, I.
A
study of dew water yields on Galvanized iron roofs in Kothara (North-West
India)
Journal of Arid Environments, V. 69, I. 2, 259-269, 2007
Jacobs,
A.F.G.; Heusinkveld, B.G.; Berkowicz, S.M.
Passive dew collection in a grassland area
Atmospheric
Research 87 (2007), 3-4. 377 - 385.
The
structure of the lattice of combinatorial Rees-Sushkevich varieties
Proc
of Conf. Semigroups & Formal Lang. Portugal, World Sci.
164-187, 2007
A
new method in the finite basis problem with applications to rank 2
INT.J.
OF ALG. AND COMPUT. 17 (7): 1431-1463, 2007
MINIMAL
SEMIGROUPS GENERATING VARIETIES WITH
Internat. J. Algebra Comput.,
17(8), 1553 - 1572, 2007
Volkov
MV.
Synchronizing automata preserving a chain of partial orders
CIAA
2007, Prague, LECT. NOTES IN COMPUT. SCI. 4783, 27-37, 2007
On
a Simpler Basis for the Pseudovariety EDS
Semigroup
Forum, 75 (2): 477-479, 2007
Kamilla
Katai-Urban, Csaba Szabo
ON
THE FREE SPECTRUM OF THE
VARIETY GENERATED BY
THE COMBINATORIAL COMPLETELY 0-SIMPLE SEMIGROUPS
Glasgow
Math. J., 49, 1:, 93-98, 2007
Ananichev DS,
Volkov MV, Zaks YI.
Synchronizing automata with a letter of deficiency 2.
THEORETICAL
COMPUTER SCIENCE, 376, 1-2, 30-41, 2007
LECTURE NOTES IN COMPUTER
SCIENCE 4484, 234-243, 2007
On border relations on finite automata (Ia ioiioaiee a?aieo ia eiia?iuo aaoiiaoao)
Proceedings
of Int. Conf. Intellect Systems and
Comp. Sci. MGU, 2006
L Kontorovich, C Cortes, M Mohri
Learning
linearly separable languages
Lecture Notes in Computer Science, 4264(2006), 288-303
Execution monitoring enforcement for limited memory systems
Proc.
of the 2006 Int. Conf. on Privacy, Security and Trust,
ACM
Int.Conf.Proc. Series; V 380, 2006
140 Mazurov V.D., Khukhro E.I.
Unsolved
problems in the theory of groups
Kourovka
notes, Novosibirsk, 2006 (Russian)
Adam
Roman
Merging states and synchronization problem
Schedae Informaticae 15 (2006), 95-108
Reviewer:
Marcel G. Jackson, MR2228521 (2007c:20130)
Lee, Edmond W. H.
Subvarieties
of the variety generated by the five-element Brandt semigroup.
Int.
J. Algebra Comput. 16 (2006), no. 2, 417--441. 20M07
Reviewer:
I. Kozhukhov, Ref J Mat. (2006 .12-13-A06.152)
JOURNAL
OF ARID ENVIRONMENTS 64 (1): 54-76 JAN 2006
Model-based
testing of reactive systems: advanced lectures
LNCS, NY, Springer, 3472, 2005
LECT. NOTES IN COMPUT. SCI.,Springer, 3472, 117-149, 2005
Homing
and Synchronizing Sequences
LECT.
NOTES IN COMPUT. SCI.,Springer, 3472, 5-33, 2005
Reviewer:
Shelly L. Wismath MR2190950 (2006i:20065)
On
a question by Edmond W. H. Lee.
Izv.
Ural. Gos. Univ. Mat. Mekh. No. 7(36) (2005), 167--178, 193.
120.
Reviewer: Heinz Mitsch MR2050901 (2005d:20102)
Lee, Edmond W. H.
Identity
bases for some non-exact varieties.
Semigroup Forum 68 (2004), no. 3, 445--457., 2005
Synchronizing
finite automata with short reset words
LECTURE SERIES ON COMPUTER AND
COMPUTATIONAL SCIENCES
Finite
quasivarieties and self-referential conditions.
Studia
Logika, v. 78 (1-2), 337-348, 2004
[Translation
of Mat. Tr. 6 (2003), no. 1, 98--154;].
Siberian
Adv. Math. 14 (2004) 2, 27--78.
Reviewer
Volkov, M. V. :Zbl 1069.08007
Flavio
d'Alessandro, Jacques Sakarovitch
The
finite power property in free groups
Theoret. comput.. sci., 1(293), Elsevier, 2003, 55-82
Fundem.
and appl. math. iss. 3, 8(2002), 829-876 (Russian)
in "The
Concise Handbook of Algebra"(eds. A.V. Mikhalev,
G.F.
Pilz). Boston: Kluwer Ac. Publ., 1-70, 2002
Finite
semigroups. An introduction to a unified theory of pseudovarieties
in
Sem., Alg. ,Aut. and Languages, eds Gomes, Pin.Silva. World Sci., , 2002
SHUFFLE
DECOMPOSITIONS OF REGULAR LANGUAGES
Int.
J. of Foundations of Computer Science, 799-816, Vol. 13 No. 6 (2002)
90.
Christian Glazer , Heinz Schmitz
The
Boolean Structure of Dot-Depth One
Journal
of Automata, Languages and Combinatorics v.6, N4, 437-452, 2001
Piecewise
and local threshold testability of DFA. Lect. Notes in Comp. Sci, 2138(2001),
347-358,
13 Int. Symp. on Fund. of Comput. Theory., Riga, Latvia, Aug. 2001.
Reviewer:
Volkov MV., Zbl 0959.20052
Varieties
of involution semigroups and involution semirings: a survey,
Proc.
of the Int. Conf. "Contemp. Develop. in Math." (Banja Luka, 2000),
special
issue of Bulletin of Society of Mathematicians of Banja Luka 9 (2002), 7-47
Power
semigroups. Results and problems.
Gorbunov
V.A.
Algebraic Theory of Quasivarieties,
Springer, 1998
Reviewer:
Sheila Oates-Williams. MR1477738 (98j:20087)
Volkov, M. V.
On
a finite basis problem for universal positive formulas
AlgebraUniversalis,
1(35), 1996
Normal
bands and their inverse semigroups of bicongruences
J.
of Algebra, 185(2), 502-526, 1996
Semigroups,
automata and languages
(Porto, 1994), 263-280,
WorldSci. Pub. NJ, 1996
A
NEGATIVE ANSWER TO A QUESTION OF WILKE ON
INF.
PROCESSING LETTERS 56 (4): 197-200, 1995
R.Poschel,
M. V. Sapir, N. W. Sauer, M. G. Stone and
M. V. Volkov
Identities
in full transformation semigroups
Algebra
Universalis, 4(31), 1994
Almeida J.
FINITE SEMIGROUP AND UNIVERSAL ALGEBRA
World Sci., Singapore-London-Hong Kong, 1994
IDENTITIES OF THE NATURAL REPRESENTATION OF
THE INFINITELY BASED SEMIGROUP
PROC. OF THE AMER. MATH. SOC.
118 (3): 931-937 JUL 1993
The word problem for the bifree combinatorial strict
regular semigroup.
Math. Proc. Of Cambridge Phil.
Soc. 113, no 3, 519—533, 1993
SAPIR MV
ON CROSS SEMIGROUP VARIETIES AND RELATED QUESTIONS
SEMIGROUP FORUM 42(3), 345-361,1991