18 packages tagged with “dfa”
.NET port of dk.brics.automaton - Project Fare is an effort to bring a DFA/NFA (finite-state automata) implementation from Java to .NET. There are quite a few implementations available in other languages today. This project aims to fill the gap in .NET.
Simple DFA-based regular expressions for .NET.
This package contains C# code examples that shows how to use the DoubleClick for Advertisers API Dotnet library to write .NET clients to programmatically access DFA accounts.
This library provides you with functionality to access DoubleClick for Advertisers API.
Sometimes you need faster and more robust matching than you can get out of DotNet regular expressions. Maybe they're too slow for you, or you get stack overflows when you match things that are too long, or maybe you want to search for many patterns simultaneously. There plenty of lexical analysis tools you can use, but they involve a lot of fuss. They make you write specifications in a domain-specific language, often mixed with code, and then generate new code for a scanner that you have to incorporate into your build and use in pretty specific ways. DFALex provides that powerful matching capability without all the fuss. It will build you a deterministic finite automaton (DFA, googlable) for a matching/finding multiple patterns in strings simultaneously, which you can then use with various matcher classes to perform searching or scanning operations. Unlike other tools which use DFAs internally, but only build scanners with them, DFALex provides you with the actual DFA in an easy-to-use form. Yes, you can use it in standard scanners, but you can also use it in other ways that don't fit that mold. DFALex is written in Java by Matt Timmermans (https://github.com/mtimmerm/dfalex). It was ported to .Net by Magne Rasmussen.
Minimalistic state machine. Commonly used types: • IState<TContext, TEvent, TState> • StateMachine<TContext, TEvent, TState> • IAsyncState<TContext, TEvent, TState> • AsyncStateMachine<TContext, TEvent, TState>
This are all the references needed for my project DFASimulator
CityLizard Framework allows developers to design strongly typed XML and HTML using .NET languages, such as C#, VB, F#, Nemerle. The project inspired by LINQ to XSD and Sharp DOM.
High-performance regex engine supporting intersection and complement operations
A DFA based regular expression library, lexer engine, compiler, and code generator
FsmModel is a library for creating and using Finite Automata (Finite State Machines).
A DFA lexer generator tool
Generates fast DFA lexers and matchers in C# during the build process
FsmModel.Loaders is a library with tools for loading transition tables from files and convert it into DFA models.
A simple DFA library that accepts binary strings divisible by 3
A library for layout and visualization of Automata. Includes core library Automata.Core.
A light-weight library for creation, manipulation and minimization of finite-state automata
A C# source generator for finite-state machines ‐ easily referenced as a Roslyn analyzer.