Tag automata - Esta é a página 151 - GeneraCodice

Relation between simple and regular grammars

https://www.generacodice.com/pt/articolo/1096251/relation-between-simple-and-regular-grammars

automata - formal-grammars - regular-languages - context-free

cs.stackexchange

DFA with limited states

https://www.generacodice.com/pt/articolo/1095857/dfa-with-limited-states

finite-automata - automata - formal-languages - regular-languages

cs.stackexchange

Are there undecidable properties of non-turing-complete automata?

https://www.generacodice.com/pt/articolo/1095778/are-there-undecidable-properties-of-non-turing-complete-automata

computability - automata - undecidability

cs.stackexchange

Words that have the same right- and left-associative product

https://www.generacodice.com/pt/articolo/1095300/words-that-have-the-same-right-and-left-associative-product

finite-automata - automata - formal-languages - regular-languages - nondeterminism

cs.stackexchange

What is a good reference to learn about state transition systems?

https://www.generacodice.com/pt/articolo/1095045/what-is-a-good-reference-to-learn-about-state-transition-systems

computability - automata - computation-models - reference-request

cs.stackexchange

How to prove a language is regular?

https://www.generacodice.com/pt/articolo/1095039/how-to-prove-a-language-is-regular

automata - formal-languages - reference-question - regular-languages - proof-techniques

cs.stackexchange

Power of nondeterministic type-1 min-heap automaton with both a heap and a stack

https://www.generacodice.com/pt/articolo/1093166/power-of-nondeterministic-type-1-min-heap-automaton-with-both-a-heap-and-a-stack

automata - formal-languages

cs.stackexchange

Computational power of nondeterministic type-1 min-heap automata with multiple heaps

https://www.generacodice.com/pt/articolo/1093063/computational-power-of-nondeterministic-type-1-min-heap-automata-with-multiple-heaps

automata - formal-languages

cs.stackexchange

How does a two-way pushdown automaton work?

https://www.generacodice.com/pt/articolo/1092531/how-does-a-two-way-pushdown-automaton-work

computability - automata - formal-languages - pushdown-automata

cs.stackexchange

Are Turing machines more powerful than pushdown automata?

https://www.generacodice.com/pt/articolo/1092469/are-turing-machines-more-powerful-than-pushdown-automata

turing-machines - computability - automata - formal-languages - pushdown-automata

cs.stackexchange

Resultados encontrados: 1556