Keywords: زبان رسمی; Weighted automaton; Determinism; Sequentiality; Pure sequentiality; Formal languages;
مقالات ISI زبان رسمی (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: زبان رسمی; Formal methods; Formal languages; Parametric timed automata; Event-recording automata;
Keywords: زبان رسمی; Formal languages; Theory of computation; Algorithms;
Keywords: زبان رسمی; Formal languages; Biologically inspired formal systems; Descriptional complexity;
Keywords: زبان رسمی; Duplication; Prefix-suffix square reduction; Primitive square reduction root; Formal languages;
Keywords: زبان رسمی; Discrete event systems; Decentralized observability; Formal languages;
Keywords: زبان رسمی; Hilbert series; Formal languages; Infinite dimensional polynomial ring; Invariance up to symmetry; Equivariant Groebner bases;
Keywords: زبان رسمی; Automata; Formal languages; Shannon information;
Keywords: زبان رسمی; Formal languages; Multi-counter machine; Real-time partially blind machine; Petri Net language; Petri Net normal form; Quasi-deterministic counter machine; Consensual language; Multiset machine; Modulo scheduling;
Keywords: زبان رسمی; Security policies; Formal languages; Semantics; Integration; XACML;
Keywords: زبان رسمی; Regular language; Atoms of a language; Syntactic left-congruence classes; Automata theory; Formal languages
Keywords: زبان رسمی; Ultrafilters; Formal languages; Profinite equations; Regular languages; Stone duality
Keywords: زبان رسمی; Visibly automata; Formal verification; Model checking; Pushdown automata; Automata-theoretic approach to system verification; Formal languages;
Keywords: زبان رسمی; Formal languages; Formal models of computing; Timed automata; Real-time systems; Pushdown systems; Recursive state machines
Keywords: زبان رسمی; Formal languages; Combinatorics of words; Piecewise testable languages; Subwords and subsequences
Keywords: زبان رسمی; Formal languages; Sturmian word; Standard word; Power; Continued fraction
Keywords: زبان رسمی; Theory of computation; Formal languages; Computational complexity; Decision problems; Infinite Post Correspondence Problem; Exact complexity; Î 10-complete;
Keywords: زبان رسمی; Formal languages; Graph grammars; Node replacement system; Dynamic node relabeling
Keywords: زبان رسمی; Non-overlapping inversion; Finite-state automata; Formal languages
Keywords: زبان رسمی; Fully abstract semantics; Trace semantics; Untyped assembly language; Protected modules architectures; Formal languages
Keywords: زبان رسمی; Formal languages; Parallel rewriting systems; Parsing
Keywords: زبان رسمی; Formal languages; Information; Time criticality; Advice; Finite automata
Keywords: زبان رسمی; Formal languages; One-sided random context grammars; Right random context rules; Reduction
Keywords: زبان رسمی; Lattices; Lattices of subsets of N; Formal languages; Theory of computation; Regular subsets of N; Closure properties;
Keywords: زبان رسمی; Temporal logic; CTL⁎; Formal languages; Expressive power; Model checking; Satisfiability
Keywords: زبان رسمی; Word problem; Formal languages; Visibly pushdown languages
The Viterbi algorithm for subsets of stochastic context-free languages
Keywords: زبان رسمی; Stochastic grammar; Stochastic automaton; Linear language; One-counter language; Formal languages;
Balancedness of MSO transductions in polynomial time
Keywords: زبان رسمی; Balanced parentheses; Dyck languages; Context-free languages; MSO definable transductions; Formal languages;
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
Keywords: زبان رسمی; Formal languages; Tree automata; Algorithms;
Automated HAZOP revisited
Keywords: زبان رسمی; Automated HAZOP analysis; Fault tree synthesis; Hazard identification completeness; HAZOP quality; Formal languages; Alarm analysis;
Parametric runtime verification is NP-complete and coNP-complete
Keywords: زبان رسمی; Runtime monitoring; Computational complexity; Formal languages; Parametric words; Membership problems;
Pseudoknot-generating operation
Keywords: زبان رسمی; Pseudoknots; Pseudoknot-generating operation; Closure and decision properties; Formal languages;
Computing abelian complexity of binary uniform morphic words
Keywords: زبان رسمی; Formal languages; Algorithms; Analysis of algorithms; Abelian complexity; Morphisms; Morphic words; Automatic sequences
Existence of finite test-sets for k-power-freeness of uniform morphisms
Keywords: زبان رسمی; Formal languages; Combinatorics on words; k-Power-free words; Morphisms; Test-sets
Testing DNA code words properties of regular languages
Keywords: زبان رسمی; DNA computing; Formal languages; Regular languages; Automata theory
Flip-pushdown automata with k pushdown reversals and E0L systems are incomparable
Keywords: زبان رسمی; Formal languages; E0L systems; Pushdown automata
On the topological complexity of ω-languages of non-deterministic Petri nets
Keywords: زبان رسمی; Formal languages; Languages of infinite words; Petri nets; Büchi acceptance condition; Cantor space; Topological complexity; Borel hierarchy, complete sets
Borderedness-preserving homomorphisms
Keywords: زبان رسمی; Combinatorial problems; Formal languages; Homomorphism; D-primitive; Primitive; d1d1-Word; d2d2-Word; Bifix code
Parallel parsing of operator precedence grammars
Keywords: زبان رسمی; Formal languages; Parallel algorithms; Operator precedence languages; Local parsability; Parallel parsing; Incremental parsing
A note on the complexity of matching patterns with variables
Keywords: زبان رسمی; Computational complexity; Formal languages; Pattern matching with variables; Parameterised pattern matching; NP-complete problems; Membership problem for pattern languages
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
Towards the Design of Safety-Critical Software
Keywords: زبان رسمی; Safety-critical software; hazard; formal languages; CIIP
Strict bounds for pattern avoidance
Keywords: زبان رسمی; Formal languages; Combinatorics on words; Pattern avoidance; Power series; Partial words
Conjunctive and Boolean grammars: The true general case of the context-free grammars
Keywords: زبان رسمی; Formal languages; Context-free grammars; Conjunctive grammars; Boolean grammars; Parsing; Language equations
Fast brief practical DFA minimization
Keywords: زبان رسمی; Algorithms; Formal languages; Data structures; Deterministic finite automata; Partition refinement
Efficient inclusion testing for simple classes of unambiguous ω-automata
Keywords: زبان رسمی; Formal languages; Automata theory; ω-Automata; Unambiguous automata; Inclusion
On multi-head automata with restricted nondeterminism
Keywords: زبان رسمی; Formal languages; Multi-head automata; Restricted nondeterminism
Regular set of representatives for time-constrained MSC graphs
Keywords: زبان رسمی; Formal languages; Formal methods; Specification languages; Timed automata; Partial order languages; MSC graphs; Set of representatives
Reversible pushdown automata
Keywords: زبان رسمی; Reversible computations; Pushdown automata; Formal languages; Closure properties; Decidability questions
The inclusion problem for regular expressions
Keywords: زبان رسمی; Formal languages; Regular expressions; Inclusion; 1-unambiguity