Pages that link to "Item:Q4506483"
From MaRDI portal
The following pages link to Introduction to automata theory, languages, and computation. (Q4506483):
Displaying 50 items.
- Immunity and pseudorandomness of context-free languages (Q653340) (← links)
- Exact synchronization for finite-state sources (Q658481) (← links)
- A Gel'fand-type spectral radius formula and stability of linear constrained switching systems (Q665932) (← links)
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- Second-level algorithms, superrecursivity, and recovery problem in distributed systems (Q692890) (← links)
- Acyclic networks maximizing the printing complexity (Q703493) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- Analysis and control of fuzzy discrete event systems using bisimulation equivalence (Q714871) (← links)
- Maximal bifix codes of degree 3 (Q723611) (← links)
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- Blocking of group automata. II: Mutual interlocking. (Q734168) (← links)
- Exponential bounds for convergence of entropy rate approximations in hidden Markov models satisfying a path-mergeability condition (Q744238) (← links)
- Regularity of a dynamic neighborhood of a regular language (Q764745) (← links)
- Agent-based modeling of the context dependency in T cell recognition (Q776621) (← links)
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- Matching regular expressions on uncertain data (Q832529) (← links)
- Application of the trace assertion method to the specification, design, and verification of automaton programs (Q840086) (← links)
- A power-set construction for reducing Büchi automata to non-determinism degree two (Q845908) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Linear algorithm for lexicographic enumeration of CFG parse trees (Q848238) (← links)
- An approximation algorithm for state minimization in 2-MDFAs (Q855011) (← links)
- A geometric characterization of automatic semigroups (Q861269) (← links)
- On dynamic topological and metric logics (Q865049) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Testing DNA code words properties of regular languages (Q896711) (← links)
- Pseudorandom generators against advised context-free languages (Q899305) (← links)
- Scheme inclusion verification algorithm in algebraic model of programs with constants (Q927457) (← links)
- The automata that define representations of monomial algebras. (Q930352) (← links)
- Computation in finitary stochastic and quantum processes (Q933429) (← links)
- On length-separating test tube systems (Q934977) (← links)
- On the equivalence of stationary and finite-nonstationary nondeterministic automata (Q946032) (← links)
- The domino problem of the hyperbolic plane is undecidable (Q954981) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651) (← links)
- On regular temporal logics with past (Q977176) (← links)
- Incremental learning with temporary memory (Q982647) (← links)
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization (Q983034) (← links)
- An elementary proof of a generalization of double Greibach normal form (Q987803) (← links)
- The enumeration of permutations sortable by pop stacks in parallel (Q987841) (← links)
- Solving path problems on the GPU (Q991105) (← links)
- Powers of rationals modulo 1 and rational base number systems (Q1001417) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- Abstract models for dialogue protocols (Q1006459) (← links)
- Processes with local and global liveness requirements (Q1007234) (← links)
- On \(\tau\)-adic representations of integers (Q1008948) (← links)
- On the closure of pattern expressions languages under intersection with regular languages (Q1015391) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Statistical mechanics of complex systems for pattern identification (Q1016085) (← links)
