The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Wit Forys" ( http://dblp.L3S.de/Authors/Wit_Forys )

  Author page on DBLP  Author page in RDF  Community of Wit Forys in ASPL-2

Publication years (Num. hits)
2002-2011 (12)
Publication types (Num. hits)
article(9) inproceedings(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 6 keywords

Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Wit Forys, Juan Luis García Guirao, Piotr Oprocha A dynamical model of parallel computation on bi-infinite time-scale. Search on Bibsonomy J. Computational Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Wit Forys, Janusz Matyja An Example of One-sided, D-chaotic CA Over Four Elementary Alphabet, Which is Not E-chaotic and Not Injective. Search on Bibsonomy J. Cellular Automata The full citation details ... 2011 DBLP  BibTeX  RDF
1Wit Forys, Piotr Oprocha Infinite Traces and Symbolic Dynamics - the Minimal Shift Case. Search on Bibsonomy Fundam. Inform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Wit Forys, Piotr Oprocha, Slawomir Bakalarski Symbolic Dynamics, Flower Automata and Infinite Traces. Search on Bibsonomy CIAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Wit Forys, Piotr Oprocha Infinite Traces and Symbolic Dynamics. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Shift on traces, Entropy, Trace, Transitivity, Word, Dynamical language, Shift
1Wit Forys, Piotr Oprocha Pseudo-Random Walks On Graphs And Cryptography. Search on Bibsonomy FCS The full citation details ... 2009 DBLP  BibTeX  RDF
1Adam Roman, Wit Forys Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. Search on Bibsonomy SOFSEM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Wit Forys, Tomasz Krawczyk An algorithmic approach to the problem of a semiretract base. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Wit Forys Retractions and retracts of free topological monoids. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Wit Forys Asymptotic behaviour of bi-infinite words. Search on Bibsonomy ITA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Wit Forys, Tomasz Krawczyk, James A. Anderson Semiretracts--a counterexample and some results. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Wit Forys Some Characterization of Recursively Enumerable Sets. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #12 of 12 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.