Finite_state_tool | Deterministic Finite Automaton

by Angeld55 C++ Version: v0.7 License: No License

X-Ray Key Features Code Snippets(3)Community Discussions Vulnerabilities Install Support

kandi X-RAY | Finite_state_tool Summary

Finite_state_tool is a C++ library. Finite_state_tool has no bugs, it has no vulnerabilities and it has low support. You can download it from GitHub.

Work with Deterministic Finite Automaton (DFA), Non-deterministic Finite Automaton (NFA), Non-deterministic pushdown automation (NPDA), Context-free grammars (CFG).

Support

Quality

Security

License

Reuse

Support

Finite_state_tool has a low active ecosystem.

It has 13 star(s) with 1 fork(s). There are 1 watchers for this library.

It had no major release in the last 12 months.

Finite_state_tool has no issues reported. There are no pull requests.

It has a neutral sentiment in the developer community.

The latest version of Finite_state_tool is v0.7

Quality

Finite_state_tool has no bugs reported.

Security

Finite_state_tool has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

License

Finite_state_tool does not have a standard license declared.

Check the repository for any license declaration and review the terms closely.

Without a license, all rights are reserved, and you cannot use the library in your applications.

Reuse

Finite_state_tool releases are available to install and integrate.

Installation instructions are not available. Examples and code snippets are available.

Top functions reviewed by kandi - BETA

kandi's functional review helps you automatically verify the functionalities of the libraries and avoid rework.
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of Finite_state_tool

Get all kandi verified functions for this library.

Finite_state_tool Key Features

No Key Features are available at this moment for Finite_state_tool.

Finite_state_tool Examples and Code Snippets

2. Non-deterministic Pushdown Automation

C++

Lines of Code : 32

License : No License

Copy

// Example for Nondeterministic pushdown automata for { ww^rev | w in {a,b}* }
int main()
{
	NPDA PA(3); //3 initial states

	PA.makeStateFinal(2);

	PA.addTransition({ "0", "a", "#", "0", "A#" });

	PA.addTransition({ "0", "b", "#", "0", "B#" });
	P

Creation

C++

Lines of Code : 20

License : No License

Copy

int main()
{

	// Automation for a(a+b)*
	FiniteStateAutomation A("a(a+b)*");
	
	std::string computation;
	cout << A.accepts("abbb", computation) << endl; //true;
	cout << A.accepts("bbba", computation) << endl; //false

	Fini

Creation,Example of creating and minimizing a FSA

C++

Lines of Code : 16

License : No License

Copy

#include "FiniteStateAutomation.h"

int main() 
{
	//Regex: a(a+b)*b + b(a+b)*a
	FiniteStateAutomation A("a(a+b)*b+b(a+b)*a");

	A.print(); //Image 1 and 2

	A.minimize();

	A.print(); // Image 3 and 4.

   	return 0;
}

Community Discussions

No Community Discussions are available at this moment for Finite_state_tool.Refer to stack overflow page for discussions.

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install Finite_state_tool

You can download it from GitHub.

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

Find more information at: