BenBurgers.FormalLanguagesAutomata 0.4.6-alpha

.NET 5.0
This is a prerelease version of BenBurgers.FormalLanguagesAutomata.
Install-Package BenBurgers.FormalLanguagesAutomata -Version 0.4.6-alpha
dotnet add package BenBurgers.FormalLanguagesAutomata --version 0.4.6-alpha
<PackageReference Include="BenBurgers.FormalLanguagesAutomata" Version="0.4.6-alpha" />
For projects that support PackageReference, copy this XML node into the project file to reference the package.
paket add BenBurgers.FormalLanguagesAutomata --version 0.4.6-alpha
The NuGet Team does not provide support for this client. Please contact its maintainers for support.
#r "nuget: BenBurgers.FormalLanguagesAutomata, 0.4.6-alpha"
#r directive can be used in F# Interactive, C# scripting and .NET Interactive. Copy this into the interactive tool or source code of the script to reference the package.
// Install BenBurgers.FormalLanguagesAutomata as a Cake Addin
#addin nuget:?package=BenBurgers.FormalLanguagesAutomata&version=0.4.6-alpha&prerelease

// Install BenBurgers.FormalLanguagesAutomata as a Cake Tool
#tool nuget:?package=BenBurgers.FormalLanguagesAutomata&version=0.4.6-alpha&prerelease
The NuGet Team does not provide support for this client. Please contact its maintainers for support.

This package targets RC1 of .NET 5 and is in development.
Services, interfaces and implementations for Formal Languages and Automata.
Includes automata deterministic and non-deterministic finite accepters, deterministic and non-deterministic pushdown accepters, Turing Machines, grammars and tree nodes.

Product Versions
.NET net5.0 net5.0-windows net6.0 net6.0-android net6.0-ios net6.0-maccatalyst net6.0-macos net6.0-tvos net6.0-windows
Compatible target framework(s)
Additional computed target framework(s)
Learn more about Target Frameworks and .NET Standard.

NuGet packages (1)

Showing the top 1 NuGet packages that depend on BenBurgers.FormalLanguagesAutomata:

Package Downloads
BenBurgers.FormalLanguagesAutomata.Specializations

This package targets RC1 of .NET 5 and is in development. Specializations of formal languages and automata: a Password Strength Accepter. (faster than regular expressions, if logging is disabled), a Sequence Consumer that consumes a particular sequence from a tape of symbols.

GitHub repositories

This package is not used by any popular GitHub repositories.

Version Downloads Last updated
0.4.6-alpha 188 10/6/2020
0.4.5-alpha 226 10/4/2020
0.4.3-alpha 229 10/3/2020
0.3.0-alpha 208 9/26/2020
0.2.0-alpha 206 9/25/2020
0.1.1-alpha 172 9/24/2020
0.1.0-alpha 164 9/24/2020

Added Turing Machines with 2 and 3 tapes.