Complementation of Büchi automaton

Results: 15



#Item
1A Sharp Existence Theorem for Vortices in the Theory of Branes1 Xiaosen Han2 arXiv:1110.1423v2 [math-ph] 18 JunInstitute of Contemporary Mathematics

A Sharp Existence Theorem for Vortices in the Theory of Branes1 Xiaosen Han2 arXiv:1110.1423v2 [math-ph] 18 JunInstitute of Contemporary Mathematics

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-06-19 02:20:50
2Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version) Juli´an Samborski-Forlese IMDEA Software Institute, Madrid, Spain Email:

Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version) Juli´an Samborski-Forlese IMDEA Software Institute, Madrid, Spain Email:

Add to Reading List

Source URL: software.imdea.org

Language: English - Date: 2014-06-27 10:56:07
3Ramsey-Based Analysis of Parity Automata Oliver Friedmann1 and Martin Lange2 1 Dept. of Computer Science, Ludwig-Maximilians-University of Munich, Germany School of Electr. Eng. and Computer Science, University of Kassel

Ramsey-Based Analysis of Parity Automata Oliver Friedmann1 and Martin Lange2 1 Dept. of Computer Science, Ludwig-Maximilians-University of Munich, Germany School of Electr. Eng. and Computer Science, University of Kassel

Add to Reading List

Source URL: files.oliverfriedmann.de

Language: English - Date: 2012-02-10 07:43:13
4Ramsey Goes Visibly Pushdown Oliver Friedmann1 , Felix Klaedtke2 , and Martin Lange3 1 LMU Munich, 2 ETH Zurich, and 3 University of Kassel

Ramsey Goes Visibly Pushdown Oliver Friedmann1 , Felix Klaedtke2 , and Martin Lange3 1 LMU Munich, 2 ETH Zurich, and 3 University of Kassel

Add to Reading List

Source URL: files.oliverfriedmann.de

Language: English - Date: 2013-02-13 07:24:13
5JMLR: Workshop and Conference Proceedings 34:182–192, 2014 Proceedings of the 12th ICGI An example distribution for probabilistic query learning of simple deterministic languages

JMLR: Workshop and Conference Proceedings 34:182–192, 2014 Proceedings of the 12th ICGI An example distribution for probabilistic query learning of simple deterministic languages

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2014-08-26 06:56:50
6Toward a structure theory of ω-regular trace languages Namit Chaturvedi LaBRI, Bordeaux 11 Mar. 2014

Toward a structure theory of ω-regular trace languages Namit Chaturvedi LaBRI, Bordeaux 11 Mar. 2014

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2014-03-17 08:01:44
7Toward a structure theory of ω-regular trace languages Namit Chaturvedi Frontiers of Recognizability 29 Apr. 2014

Toward a structure theory of ω-regular trace languages Namit Chaturvedi Frontiers of Recognizability 29 Apr. 2014

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2014-04-30 05:42:23
8Noname manuscript No. (will be inserted by the editor) Synchronizing Relations on Words Diego Figueira · Leonid Libkin

Noname manuscript No. (will be inserted by the editor) Synchronizing Relations on Words Diego Figueira · Leonid Libkin

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2014-11-26 07:54:43
9ACRS_main-revised-april2014.dvi

ACRS_main-revised-april2014.dvi

Add to Reading List

Source URL: logica.ugent.be

Language: English - Date: 2014-06-16 09:06:25
10Invariants for equivalence of finite automata Mike Spivey Let S = (S, Σ, δS , s0 , FS ) and T = (T , Σ, δT , t0 , FT ) be two deterministic finite automata with the same alphabet Σ. We say S and T are equivalent if,

Invariants for equivalence of finite automata Mike Spivey Let S = (S, Σ, δS , s0 , FS ) and T = (T , Σ, δT , t0 , FT ) be two deterministic finite automata with the same alphabet Σ. We say S and T are equivalent if,

Add to Reading List

Source URL: spivey.oriel.ox.ac.uk

Language: English - Date: 2010-02-09 12:35:41