Results 111 to 120 of about 157,848 (165)
On the word problem for syntactic monoids of piecewise testable languages
Semigroup Forum, 2011 Piecewise testable languages are widely studied area in the theory of automata. We analyze the algebraic properties of these languages via their syntactic monoids. In this paper a normal form is presented for 2- and 3-piecewise testable languages and a log-asymptotic estimate is given for the number of words over these monoids.
Kamilla Kátai-Urbán +4 more
openalex +3 more sources
, 1991 Abstract In this chapter we obtain another characterization of rational languages in terms of a monoid Syn(L), called the syntactic monoid of L, associated with every L ⊆ A*. The computation of Syn(L) is then discussed, via a notion important in its own right, namely the minimal automaton of L.
John Howie
openalex +2 more sources
ON GROUPS WHICH ARE SYNTACTIC MONOIDS OF DETERMINISTIC CONTEXT-FREE LANGUAGES
International Journal of Algebra and Computation, 2004 The author shows that the class of groups which are syntactic monoids of deterministic context-free languages is closed under restricted standard wreath products with virtually free top groups. This provides an answer to a question of T. Herbst.
Claas E. Röver
openalex +4 more sources
On scattered syntactic monoids
, 1993 The main result of this paper is a Myhill-Nerode-like theorem for languages L with the property that the commutative closure of L, com(L), is a regular language. This problem arises in a natural way when one considers the scattered deletion operation and some other related problems.
Alexandru Mateescu
openalex +3 more sources
Syntactic Complexity of Circular Semi-Flower Automata [PDF]
International Conference on Implementation and Application of Automata, 2013 We investigate the syntactic complexity of certain types of finitely generated submonoids of a free monoid. In fact, we consider those submonoids which are accepted by circular semi-flower automata (CSFA).
S. Singh, K. V. Krishna
semanticscholar +3 more sources
The syntactic monoid of θ-free palindromic words
Advances in Applied MathematicsKalpana Mahalingam
openalex +2 more sources
On the theory of syntactic monoids for rational languages
, 1977 Jean-François Perrot
+5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Syntactic Minimization of Nondeterministic Finite Automata
International Symposium on Mathematical Foundations of Computer Science, 2021Nondeterministic automata may be viewed as succinct programs implementing deterministic automata, i.e. complete specifications. Converting a given deterministic automaton into a small nondeterministic one is known to be computationally very hard; in fact,
R. Myers, Henning Urbat
semanticscholar +1 more source
MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES
, 2001 Ferenc Gécseg, Magnus Steinby
openalex +2 more sources