BenBurgers.FormalLanguagesAutomata
0.3.0-alpha
See the version list below for details.
dotnet add package BenBurgers.FormalLanguagesAutomata --version 0.3.0-alpha
NuGet\Install-Package BenBurgers.FormalLanguagesAutomata -Version 0.3.0-alpha
<PackageReference Include="BenBurgers.FormalLanguagesAutomata" Version="0.3.0-alpha" />
paket add BenBurgers.FormalLanguagesAutomata --version 0.3.0-alpha
#r "nuget: BenBurgers.FormalLanguagesAutomata, 0.3.0-alpha"
// Install BenBurgers.FormalLanguagesAutomata as a Cake Addin #addin nuget:?package=BenBurgers.FormalLanguagesAutomata&version=0.3.0-alpha&prerelease // Install BenBurgers.FormalLanguagesAutomata as a Cake Tool #tool nuget:?package=BenBurgers.FormalLanguagesAutomata&version=0.3.0-alpha&prerelease
Services, interfaces and implementations for Formal Languages and Automata.
Includes deterministic and non-deterministic finite accepters.
Includes deterministic and non-deterministic pushdown accepters.
Includes Turing Machines.
Product | Versions Compatible and additional computed target framework versions. |
---|---|
.NET | net5.0 is compatible. net5.0-windows was computed. net6.0 was computed. net6.0-android was computed. net6.0-ios was computed. net6.0-maccatalyst was computed. net6.0-macos was computed. net6.0-tvos was computed. net6.0-windows was computed. net7.0 was computed. net7.0-android was computed. net7.0-ios was computed. net7.0-maccatalyst was computed. net7.0-macos was computed. net7.0-tvos was computed. net7.0-windows was computed. net8.0 was computed. net8.0-android was computed. net8.0-browser was computed. net8.0-ios was computed. net8.0-maccatalyst was computed. net8.0-macos was computed. net8.0-tvos was computed. net8.0-windows was computed. |
-
net5.0
- Microsoft.Extensions.Logging.Abstractions (>= 5.0.0-rc.1.20451.14)
NuGet packages (2)
Showing the top 2 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. |
|
BenBurgers.FormalLanguagesAutomata.Grammars
Formal grammars according to formal languages and automata theory in Computer Science. |
GitHub repositories
This package is not used by any popular GitHub repositories.
Version | Downloads | Last updated |
---|---|---|
0.5.9 | 237 | 6/17/2023 |
0.4.6-alpha | 257 | 10/6/2020 |
0.4.5-alpha | 293 | 10/4/2020 |
0.4.3-alpha | 292 | 10/3/2020 |
0.3.0-alpha | 275 | 9/26/2020 |
0.2.0-alpha | 274 | 9/25/2020 |
0.1.1-alpha | 235 | 9/24/2020 |
0.1.0-alpha | 234 | 9/24/2020 |
Added Turing Machine.