PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (236)
Orphanage
Unclass'd (1)
Unproven (540)
Corrections (50)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Copyright
About
Owner confidence rating: Very high Entry average rating: No information on entry rating
[parent] Boolean operations on automata (Definition)
ComplementOfAnAutomaton

"Boolean operations on automata" is owned by CWoo.
(view preamble | get metadata)

View style:

Also defines:  complement of an automaton, union of automata

This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: product of automata, product, equation, language, string, nodes, directed graph, deterministic, iff, finite, well-defined, complement, dfa's, label, edge, state, starting state, easy to see, state diagrams, automaton, disjoint unions, set theory, automata, intersection, union, operation, Boolean
There is 1 reference to this entry.

This is version 5 of Boolean operations on automata, born on 2008-05-11, modified 2009-09-05.
Object id is 10578, canonical name is ComplementOfAnAutomaton.
Accessed 934 times total.

Classification:
AMS MSC: 68Q45 (Computer science :: Theory of computing :: Formal languages and automata)
 03D05 (Mathematical logic and foundations :: Computability and recursion theory :: Automata and formal grammars in connection with logical questions)
Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)