automata

automata

Can a finite automata have more than one input states?

Set of conditions for Finite Automata transitions

Hierarchical State Machine in IEC 61131-3

Design state diagram of turing machine that multiplies a unary number by 2

Automata Turing

Turing Machine: take a mod of two numbers?

Finding bug in a simple NPDA

Trying to draw a Non- Deterministic Finite Automata [closed]

Automata - Construct NFA using copies of DFA - formal definition of NFA

Design a turing machine that accepts the language L= {a^2 b^2n: n>=1}

Calculator using Lex and Yacc

Meaning of combined states in DFA

Find the center letter in 2 pdf (2 stack) in automata

Construct DFA for L = {(na(w)-nb(w)) mod 3>0}

I'm trying to solve DFA

DFA that contains 1101 as a substring

DFA of Binary numbers decimal equivalent divisible by some.number n

Is epsilon and empty set languages of NFA? (Nondeterministic Finite Automata)

DPDA automata rules

Pushdown automata stack states?

Is $E_{LBA}$ a Turing recognizable language?

How can I tell that a language is context-free from first sight?

Convert a PDA to a DFA

Find the DFA for the language L given

Pumping Lemma Assistance

Regular expression 0+10*+01*0 convert to NFA

Draw deterministic automata

Design a DFA for a string {0,1} which when reversed is decimal equivalent of 2 mod 7?

How a^n b^n where n>=1 is not regular?

Finite-state automation that accepts sum of digits divisible by n

Merging final states of a DFA

How to compare two LTLs?

Automata Homework Questions

Reducing a DFA using the Pair Table method

Is a Pushdown Automaton with an Epsilon Transition a NDPA?

Automata and Formal Languages

L = {www| w belongs to {0,1}*} prove via pumping lemma

Deterministic Finite Automata minimization

Can the intersection of 2 non-regular languages be a regular language?

Show that L and Images cannot both be finite

How do ɛ-transitions work in nondeterministic finite automata?

Given a language a^n b^m such that n and m have some relation between them implies that the given language can not be regular.Am i correct? [duplicate]

NPDA for this language with n and n-1

Deterministic Finite Automata

NFA or DFA for strings the contain exactly twice substring ab?

About Regular Expression

How to partition the states of a DFA having a dead state during minimisation of the same

Automata: Developing Context Free Grammars

Can a deterministic finite acceptor begin at the end of string and move toward the start?

Deterministic Finite Automata of a simple arithmetic string

What exactly is the 'pumping length' in the Pumping lemma?

Can a Regular Language have a Linear Bounded Automaton

Formal Language syntax

Converting NFA to DFA

Pushdown Automata definition

automata: using only Equivalence class to proove regularity

FInite automata to regular expression clarification

Designing nfa that accepts couple of strings

Practical examples of NFA and epsilon NFA

PDA to accept a language of strings containing more a's than b's

page:2 of 3 prev page next page main page

Categories

google-my-business-api

spring-framework-beans

react-hook-form

project-reactor

uinavigationbar

cypress-testing-library

client-certificates

json-deserialization

advantage-database-server

single-spa-angular

graphene-django

apache-velocity

screen-recording

cllocationmanager

instruction-set

storage-access-framework

android-coordinatorlayout

visual-and-installer

procedural-programming

marshmallow-sqlalchemy

asp.net-mvc-5.1

notimplementedexception

pointer-to-pointer

java-service-wrapper

isolatedstorage

collective-intelligence

Resources