Keywords: 68Q70; 68Q45; 20M30; 16D25; 68R15; Synchronizing automaton; Strongly connected automaton; Cerny's conjecture; Minimal reset word; Ideals;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: 20F65; 68Q45; Automatic group; (Cayley) graph automatic group; Higher rank lamplighter group; Diestel-Leader group;
Keywords: 20E08; 20F10; 20M05; 20M18; 68Q17; 68Q45; 20M30; Automaton groups; Automaton semigroups; Word problem; PSpace;
Keywords: 68Q45; 20F65; 20F10; 03D05; Automatic graph; Automatic structure; Cayley automatic group; Intermediate growth; Schreier graph;
Keywords: 03C50; 03C30; 03D05; 68Q45; Automatic structures; Model theory;
Keywords: 03E60; 03E35; 03B70; 68Q45; 03D05; 68Q15; 68Q17; 03E15Automata and formal languages; Logic in computer science; Gale–Stewart games; 2-tape Büchi automaton; 1-counter automaton; Determinacy; Effective analytic determinacy; Models of set theory; Independenc
Keywords: 05E99; 68Q45; 18D50Operad; Multi-tilde; Language; Regular language; Quasiorder
Decision problems for word-hyperbolic semigroups
Keywords: 20M35; 68Q45; 20F67Word-hyperbolic semigroups; Decision problems; Undecidability; Isomorphism problem; Context-free languages
C-graph automatic groups
Keywords: 20F65; 68Q45; Automatic group; Cayley graph automatic group; Counter language; Context-sensitive language; Word problem; Polynomial time algorithm; Baumslag-Solitar group;
An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet
Keywords: 68Q45; D0L system; Equivalence problem; Ultimate equivalence problem; Decidability;
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;
Context-free languages can be accepted with absolutely no space overhead
Keywords: 03D15; 68Q05; 68Q15; 68Q42; 68Q45; Context-free languages; Deterministic context-free languages; Editing Turing machines; In-place algorithms; Linear space; Overhead-free computation; Restarting automata; RRW-automata; Space overhead; Space reuse; Two-sta
Finite automata and pattern avoidance in words
Keywords: 05A05; 05A15; 68Q45; Border-strip tableaux; Finite automata; Permutation patterns; Restricted words; Increasing patterns; Transfer matrix;
Explicit test sets for iterated morphisms in free monoids and metabelian groups
Keywords: 68Q45; 20M35; 20F10; Test set; Iterated morphism; HD0L equivalence;
Alternating automata and temporal logic normal forms
Keywords: 03B44; 68Q45; 68Q60; Temporal logic; Alternating automata; Specification and verification;
CCS with Hennessy's merge has no finite-equational axiomatization
Keywords: 08A70; 03B45; 03C05; 68Q10; 68Q45; 68Q55; 68Q70; Concurrency; Process algebra; CCS; Bisimulation; Hennessy's merge; Left merge; Communication merge; Equational logic; Complete axiomatizations; Non-finitely based algebras;
On state-alternating context-free grammars
Keywords: 68Q45; 68Q10; Alternating context-free grammar; Context-free grammar with states; State-alternating context-free grammar; Alternating pushdown automaton;