npmpackage.info

Gathering detailed insights and metrics for @turing-machine-js/library-binary-numbers

@turing-machine-js/library-binary-numbers - 2.0.0 | npmpackage.info

@turing-machine-js/library-binary-numbers

🧘🏼‍♂️ A convenient Turing machine

2.0.0

GPL-3.0

TypeScript

43.16 kB

3.8

Installations

npm install @turing-machine-js/library-binary-numbers

Developer Guide

BETA

Typescript

No

Module System

N/A

Node Version

22.7.0

NPM Version

lerna/8.1.8/node@v22.7.0+x64 (darwin)

Pull Requests

Open

0

Total

57

Closed

11

Merged

46

Issues

Open

1

Total

21

Closed

20

Releases

v1.0.0

Updated on Feb 11, 2022

v0.2.5

Updated on Apr 21, 2019

0.2.2

Updated on Apr 20, 2019

0.2.0

Updated on Apr 20, 2019

0.1.6

Updated on Apr 09, 2019

0.1.5

Updated on Apr 08, 2019

View All 8 releases

Languages

TypeScript

JavaScript

TypeScript (97.53%)

JavaScript (2.47%)

Developer

mellonis

Download Statistics

Total Downloads

Last Day

Last Week

Last Month

Last Year

GitHub Statistics

GPL-3.0 License

4 Stars

236 Commits

1 Forks

1 Watchers

1 Branches

1 Contributors

Updated on Sep 21, 2024

Maintainers

View All 1 Contributors

Package Meta Information

Latest Version

2.0.0

Package Id

@turing-machine-js/library-binary-numbers@2.0.0

Unpacked Size

43.16 kB

Size

14.03 kB

File Count

NPM Version

lerna/8.1.8/node@v22.7.0+x64 (darwin)

Node Version

22.7.0

Published on

Sep 21, 2024

Total Downloads

Cumulative downloads

Total Downloads

NaN

Last Day

NaN

Compared to previous day

Last Week

NaN

Compared to previous week

Last Month

NaN

Compared to previous month

Last Year

NaN

Compared to previous year

Weekly Downloads

Monthly Downloads

Yearly Downloads

Dependencies

@turing-machine-js/machine

turing-machine-js

GitHub issues

A convenient Turing machine

This repository contains following packages:

An example

A tape contains a, b and c symbols. The issue is to replace all b symbols by * symbol.

This example demonstrates an issue solving.

1import {
2  Alphabet,
3  State,
4  Tape,
5  TapeBlock,
6  TuringMachine,
7  haltState,
8  ifOtherSymbol,
9  movements,
10} from '@turing-machine-js/machine';
11
12const alphabet = new Alphabet([' ', 'a', 'b', 'c', '*']);
13const tape = new Tape({
14  alphabet,
15  symbols: ['a', 'b', 'c', 'b', 'a'],
16});
17const tapeBlock = TapeBlock.fromTapes([tape]);
18const machine = new TuringMachine({
19  tapeBlock,
20});
21
22console.log(tape.symbols.join('').trim()); // abcba
23
24machine.run({
25  initialState: new State({
26    [tapeBlock.symbol(['b'])]: {
27      command: [
28        {
29          symbol: '*',
30          movement: movements.right,
31        },
32      ],
33    },
34    [tapeBlock.symbol([tape.alphabet.blankSymbol])]: {
35      command: [
36        {
37          movement: movements.left,
38        },
39      ],
40      nextState: haltState,
41    },
42    [ifOtherSymbol]: {
43      command: [
44        {
45          movement: movements.right,
46        },
47      ],
48    },
49  }),
50});
51
52console.log(tape.symbols.join('').trim()); // a*c*a

Execution steps explanation

S stands for the initial state
H stands for the haltState

Step 1

Current state: S
Current symbol: 'a'
Transition: 'a'/S,R

[       abcba   ]    [       abcba   ]
        ^         >>          ^

Step 2

Current state: S
Current symbol: 'b'
Transition: '*'/S,R

[      abcba    ]    [      a*cba    ]
        ^         >>          ^

Step 3

Current state: S
Current symbol: 'c'
Transition: 'c'/S,R

[     a*cba     ]    [     a*cba     ]
        ^         >>          ^

Step 4

Current state: S
Current symbol: 'b'
Transition: '*'/S,R

[    a*cba      ]    [    a*c*a      ]
        ^         >>          ^

Step 5

Current state: S
Current symbol: 'a'
Transition: 'a'/S,R

[   a*c*a       ]    [   a*c*a       ]
        ^         >>          ^

Step 6

Current state: S
Current symbol: ' '
Transition: ' '/H,L

[  a*c*a        ]    [  a*c*a        ]
        ^         >>        ^

No vulnerabilities found.

10

Binary-Artifacts

Determines if the project has generated executable (binary) artifacts in the source repository.

10

Dangerous-Workflow

Determines if the project's GitHub Action workflows avoid dangerous patterns.

10

License

Determines if the project has defined a license.

7

SAST

Determines if the project uses static code analysis.

3

Pinned-Dependencies

Determines if the project has declared and pinned the dependencies of its build process.

3

Vulnerabilities

Determines if the project has open, known unfixed vulnerabilities.

0

Token-Permissions

Determines if the project's workflows follow the principle of least privilege.

0

Code-Review

Determines if the project requires human code review before pull requests (aka merge requests) are merged.

0

Maintained

Determines if the project is "actively maintained".

0

CII-Best-Practices

Determines if the project has an OpenSSF (formerly CII) Best Practices Badge.

0

Security-Policy

Determines if the project has published a security policy.

0

Fuzzing

Determines if the project uses fuzzing.

Score

3.8

/10

Last Scanned on 2025-07-07

The Open Source Security Foundation is a cross-industry collaboration to improve the security of open source software (OSS). The Scorecard provides security health metrics for open source projects.

Learn More