Keywords: زبان منظم; Regular language; Suffix-free; Syntactic complexity; Transition semigroup; Upper bound;
مقالات ISI زبان منظم (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: زبان منظم; 20F36; 20M35; 20F10; Dual braid monoid; Rotating normal form; Regular language; Automata;
Keywords: زبان منظم; Regular language; Lookahead DFA; Clique number; Maximum degree; Computational complexity;
Keywords: زبان منظم; Profinite topology; Regularity preserving; Regular language; Variety of finite monoids; p-adic;
Keywords: زبان منظم; Most complex; Regular language; State complexity; Suffix-free; Syntactic complexity; Transition semigroup;
Keywords: زبان منظم; Regular language; Atoms of a language; Syntactic left-congruence classes; Automata theory; Formal languages
Keywords: زبان منظم; Regular language; Star-height; Subword; Rees matrix semigroup;
Keywords: زبان منظم; ANS; Accepting negative sample; APS; Accepting positive sample; BMODA; Bit masking oriented data structure; BNF; Backus Naur Form; BBP; Boolean based procedure; CFL; Context free language; CFG; Context free grammar; CS; Chromosome size; CM; Crossmask/cros
Keywords: زبان منظم; Galois connection; Regular algebra; Regular language; Factor matrix; Factor graph; Pattern matching;
Keywords: زبان منظم; Automata theory; Partial word; Regular language; Finite automaton; Language of partial word
Keywords: زبان منظم; Random braids; Garside monoid; Normal form; Penetration distance; Expected value; Regular language
Keywords: زبان منظم; Reversible finite automaton; Quantum finite automaton; Regular language; Context-free language; Randomized advice; Quantum advice; Rewritable tape
Keywords: زبان منظم; Algorithmic problem solving; Penney-Ante; Regular language; Probabilistic game; Generating function
Keywords: زبان منظم; 05E99; 68Q45; 18D50Operad; Multi-tilde; Language; Regular language; Quasiorder
Canonical finite models of Kleene algebra with tests
Keywords: زبان منظم; Kleene algebra with tests; Completeness theorem; Canonical finite model; Syntactic semiring; Regular language; Program optimization;
On the penetration distance in Garside monoids
Keywords: زبان منظم; primary; 20F36; 43A07; secondary; 20F69; 60B15; Garside monoids; Artin monoids; Random elements; Normal forms; Regular language; Penetration distance; Essential transitivity;
Theory of átomata
Keywords: زبان منظم; Atom; Atomic NFA; Átomaton; Left quotient; Minimization by double reversal; NFA; Regular language
The dissecting power of regular languages
Keywords: زبان منظم; Theory of computing; Formal languages; Regular language; Context-free language; Bounded language; Semi-linear; Constantly growing; Dissectible; i-Separate
Regular languages and partial commutations
Keywords: زبان منظم; Regular language; Partial commutation; Trace language; Shuffle; Variety of languages
Deciding regularity of hairpin completions of regular languages in polynomial time
Keywords: زبان منظم; Hairpin completion; Regular language; Finite automaton; Unambiguous linear language; Rational growth
Parikhʼs theorem: A simple and direct automaton construction
Keywords: زبان منظم; Formal languages; Context-free language; Regular language; Parikh image
Decision problems for convex languages
Keywords: زبان منظم; Finite automaton; Complexity; Convex language; Regular language; Prefix-free; Suffix-free; Ideal;
Immunity and pseudorandomness of context-free languages
Keywords: زبان منظم; Regular language; Context-free language; Immune; Simple; Primeimmune; Pseudorandom; Pseudorandom generator; Swapping lemma;
The self-affine property of (U,r)(U,r)-Carlitz sequences of polynomials deciphered in terms of graph directed IFS
Keywords: زبان منظم; Self-affine; Fractal; IFS; Numeration system; Regular language; Beta-expansion; Cellular automata
Hybrid one-dimensional reversible cellular automata are regular
Keywords: زبان منظم; Reversible cellular automaton; Hybrid cellular automaton; Finite state automaton; Regular language
Conditional Densities of Regular Languages
Keywords: زبان منظم; asymptotic evaluation; probabilistic density; regular language;
Regular solutions of language inequalities and well quasi-orders
Keywords: زبان منظم; 68Q45; 20M35; 68Q70; 68R05; Language equation; Regular language; Well quasi-order; Syntactic semigroup; Finite simple semigroup;