Converting Self-verifying Automata into Deterministic Automata (Q3618603)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Converting Self-verifying Automata into Deterministic Automata	scientific article

Statements

scholarly article

0 references

Converting Self-verifying Automata into Deterministic Automata (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-00982-2_39

0 references

Galina Jirásková

0 references

Giovanni Pighizzini

0 references

Language and Automata Theory and Applications

0 references

publication date

2 April 2009

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-00982-2_39

0 references

0 references

0 references

0 references

On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

0 references

Nondeterministic Communication with a Limited Number of Advice Bits

0 references

On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata

0 references

An upper bound for transforming self-verifying automata into deterministic ones

0 references

On cliques in graphs

0 references

Finite automata and unary languages

0 references

Complementing unary nondeterministic automata

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3618603

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3618603&oldid=35101521"