Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.

License

NotificationsYou must be signed in to change notification settings

angeligareta/finite-automaton-comparator

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Implementation of a Finite Automaton Comparator in C++. The FA's can be DFA or NFA.

The program can compare two Finite Automaton, they are equivalent if they can accept the same strings.The result of the program is EQUIVALENT or NOT_EQUIVALENT.

If a DFA is not minimum, the program first minimize the DFA.

Author

Ángel Luis Igareta Herráiz

Index

Usage

To start the program first you have to compile the source with MakeFile. After that you can start it executing:

.bin/compareFA FA1 FA2

After analyzing the FA passed by argument, the result of the program is EQUIVALENTE or NOT_EQUIVALENT.

Finally in the test folder there is an example of DFA and NFA test and syntax.

License

The Mit License.

About

Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published
[8]ページ先頭
©2009-2025 Movatter.jp