Wikimore

This diagram image could be re-created using vector graphics as an SVG file. This has several advantages; see Commons:Media for cleanup for more information. If an SVG form of this image is available, please upload it and afterwards replace this template with {{vector version available|new image name}}.
It is recommended to name the SVG file “Automata finito.svg”—then the template Vector version available (or Vva) does not need the new image name parameter.

Category:Diagram images that should use vector graphics#%20Automata%20finito.png Category:PNG that should use vector graphics

Summary

Description

English: Deterministic finite automaton that accepts only the strings with an even number of zeros and an even number of ones. In state q₀, q₁, q₂, q₃, an even/even, even/odd, odd/even, and odd/odd number of 0s/1s has been read, respectively.

Español: Autómata finito determinista que acepta exclusivamente las cadenas de caracteres con un número par de ceros y un número par de unos.

Date

31 March 2010

Source

Own work

Author

Farisori

Other versions

File:Automata finito.svg is a vector version of this file. It should be used in place of this PNG file when not inferior.Category:Vector version available

File:Automata finito.png → File:Automata finito.svg

For more information, see Help:SVG.

In other languages

Alemannisch ∙ العربية ∙ беларуская (тарашкевіца) ∙ български ∙ বাংলা ∙ català ∙ нохчийн ∙ čeština ∙ dansk ∙ Deutsch ∙ Ελληνικά ∙ English ∙ British English ∙ Esperanto ∙ español ∙ eesti ∙ euskara ∙ فارسی ∙ suomi ∙ français ∙ Frysk ∙ galego ∙ Alemannisch ∙ עברית ∙ हिन्दी ∙ hrvatski ∙ magyar ∙ հայերեն ∙ Bahasa Indonesia ∙ Ido ∙ italiano ∙ 日本語 ∙ ქართული ∙ 한국어 ∙ lietuvių ∙ македонски ∙ മലയാളം ∙ Bahasa Melayu ∙ မြန်မာဘာသာ ∙ norsk bokmål ∙ Plattdüütsch ∙ Nederlands ∙ norsk nynorsk ∙ norsk ∙ occitan ∙ polski ∙ prūsiskan ∙ português ∙ português do Brasil ∙ română ∙ русский ∙ sicilianu ∙ Scots ∙ slovenčina ∙ slovenščina ∙ српски / srpski ∙ svenska ∙ தமிழ் ∙ ไทย ∙ Türkçe ∙ татарча / tatarça ∙ українська ∙ vèneto ∙ Tiếng Việt ∙ 中文 ∙ 中文（中国大陆） ∙ 中文（简体） ∙ 中文（繁體） ∙ 中文（马来西亚） ∙ 中文（新加坡） ∙ 中文（臺灣） ∙ +/−

Transition monoid

	ε 0123	1 1032	0 2301	10 3210
ε 0123	ε 0123	1 1032	0 2301	10 3210
1 1032	1 1032	ε 0123	10 3210	0 2301
0 2301	0 2301	10 3210	ε 0123	1 1032
10 3210	10 3210	0 2301	1 1032	ε 0123

English: Entries denote functions mapping a state to a state; e.g. 1032 abbreviates the function mapping q₀,q₁,q₂, and q₃ to q₁, q₀, q₃, and q₂, respectively; this is the function for digesting an input 1. The table shows the result of function composition, which happens to be commutative for this automaton. Grey entries give a shortest input string corresponding to a function.

Licensing

I, the copyright holder of this work, hereby publish it under the following licenses:

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.

Category:License migration redundant#Automata%20finito.png Category:GFDL#Automata%20finito.png

This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International, 3.0 Unported, 2.5 Generic, 2.0 Generic and 1.0 Generic license.

You are free:

to share – to copy, distribute and transmit the work
to remix – to adapt the work

Under the following conditions:

attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.

Category:CC-BY-SA-4.0,3.0,2.5,2.0,1.0#Automata%20finito.png

You may select the license of your choice.

Category:Self-published work

Category:Deterministic finite state automata