Keywords: زبان های منظم; Automata theory; Regular languages; Profinite equations; Kleene star; Decidability;
مقالات ISI زبان های منظم (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: زبان های منظم; Regular languages; Context-free languages; Input-driven languages; Visibly pushdown languages; Operator-precedence languages; Monadic second order logic; Closure properties; Decidability and automatic verification;
Keywords: زبان های منظم; Regular languages; Circular splicing systems; Unavoidable sets;
Keywords: زبان های منظم; Regular languages; State complexity; Prefix distance; Finite automata;
Keywords: زبان های منظم; Rewriting system; Church-Rosser; Parikh-reducing; Regular languages;
Keywords: زبان های منظم; Language operations; Closure properties; Regular languages;
Keywords: زبان های منظم; Pushdown automata; Finite state automata; Two-way automata; Regular languages; Descriptional complexity;
Keywords: زبان های منظم; Automata; Regular languages; Syntactic monoid; Word scanning;
Keywords: زبان های منظم; Descriptional complexity; Finite state automata; Regular languages; Nondeterministic pushdown automata;
Keywords: زبان های منظم; Labeled graphs; Minimum cut; Regular languages;
Keywords: زبان های منظم; State complexity; Inversion operations; Finite automata; Regular languages
Keywords: زبان های منظم; Regular languages; Context-free languages; Boundary sets; Computational complexity; Decidability; Valid computations
Keywords: زبان های منظم; Ultrafilters; Formal languages; Profinite equations; Regular languages; Stone duality
Keywords: زبان های منظم; Regular languages; Boundary; Finite automata; State complexity
Keywords: زبان های منظم; Rational sets; Regular languages; Test specification in FQL; Closure properties; Decision problems;
Keywords: زبان های منظم; Regular algebra; Regular languages; Omega-regular algebra; Omega-regular languages; Completeness
Keywords: زبان های منظم; Functional languages; Abstract interpretation; Shape analysis; Points-to analysis; Regular languages
Keywords: زبان های منظم; Descriptional complexity; Finite state automata; Regular languages; Deterministic and nondeterministic pushdown automata
Keywords: زبان های منظم; Pseudopalindromes; Pseudopalindromic completion; Pseudopalindromic iterated completion; Regular languages; Algorithms; Decidability
Keywords: زبان های منظم; Two-way automata; Descriptional complexity; Regular languages
Keywords: زبان های منظم; Repair; Asymptotic normalized cost; Edit distance; Distance automata; Regular languages
Keywords: زبان های منظم; Spider diagrams; Diagrammatic logics; Regular languages; Expressiveness; Star-free languages;
Keywords: زبان های منظم; REGEX languages; Regular languages; Memory automata
Keywords: زبان های منظم; Descriptional complexity; Automata theory; Regular languages; Transition complexity; State complexity
On the regularity of {âlogbâ¡(αn+β)â}nâ¥0
Keywords: زبان های منظم; Automatic sequences; b-regular sequences; Regular languages;
Inferring regular languages and Ï-languages
Keywords: زبان های منظم; Grammatical inference; Model learning; Regular languages; Ï-regular languages; Right congruence; Myhill-Nerode theorem;
On block pumpable languages
Keywords: زبان های منظم; Block pumping lemma; Regular languages; Block pumpable languages; Automata theory
On the state complexity of partial word DFAs
Keywords: زبان های منظم; Automata and formal languages; State complexity; Regular languages; Partial languages; Partial words; Deterministic finite automata; Non-deterministic finite automata
Testing DNA code words properties of regular languages
Keywords: زبان های منظم; DNA computing; Formal languages; Regular languages; Automata theory
Exponentially more concise quantum recognition of non-RMM regular languages
Keywords: زبان های منظم; Quantum finite automata; Equivalence; Regular languages; Deterministic finite automata; Decidability; State complexity
Prime languages
Keywords: زبان های منظم; Deterministic finite automaton (DFA); Regular languages; DFA decomposition; Prime DFA; Prime regular languages
A representation theorem for (q-)holonomic sequences
Keywords: زبان های منظم; Holonomic sequences; q-Holonomic sequences; Positional weights on words; Regular languages; Monadic Second Order Logic
Regular and context-free pattern languages over small alphabets
Keywords: زبان های منظم; Pattern languages; Regular languages; Context-free languages
On effective construction of the greatest solution of language inequality XA⊆BXXA⊆BX
Keywords: زبان های منظم; Language equations; Regular languages; Codes; Pushdown games; One counter machine
Bounded repairability of word languages
Keywords: زبان های منظم; Bounded repair; Edit distance; Regular languages
A note on algebras of languages
Keywords: زبان های منظم; Regular languages; Context-sensitive languages; Decidable languages; Boolean algebras; Algebras of languages; Fréchet ideal;
Regular patterns, regular languages and context-free languages
Keywords: زبان های منظم; Theory of computation; Pattern languages; Regular languages; Context free languages
Linear splicing and syntactic monoid
Keywords: زبان های منظم; Automata; Regular languages; Molecular computing
Equality sets of prefix morphisms and regular star languages
Keywords: زبان های منظم; Regular languages; Star languages; Equality sets; Representation; Formal languages;
Regular frequency computations
Keywords: زبان های منظم; Frequency computation; Regular languages;
On two-way communication in cellular automata with a fixed number of cells
Keywords: زبان های منظم; Cellular automata; Regular languages; Descriptional complexity;
Regular splicing languages and subclasses
Keywords: زبان های منظم; Automata; Regular languages; Molecular computing; Splicing systems;
Entropy rates and finite-state dimension
Keywords: زبان های منظم; Finite-state dimension; Regular languages; Normal sequences;
Insights to Angluin's Learning
Keywords: زبان های منظم; deterministic finite-state automata; learning algorithm; regular languages; prefix-closed regular languages;
On the power of circular splicing
Keywords: زبان های منظم; Automata; Regular languages; Molecular computing;
Collage of two-dimensional words
Keywords: زبان های منظم; Regular languages; Picture languages;
Partially ordered regular languages for graph queries
Keywords: زبان های منظم; Databases; Graphs; Regular languages; Path queries;
The structure of reflexive regular splicing languages via Schützenberger constants
Keywords: زبان های منظم; Automata; Regular languages; Molecular computing;
A theory of computation based on quantum logic (I)
Keywords: زبان های منظم; Quantum logic; Orthomodular lattice; Algebraic semantics; Finite automata; Regular languages; Quantum computation;