Petr Kurka - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2015

The Exact Real Arithmetical Algorithm in Binary Continued FractionsPetr Kurka. arith 2015: 168-175 [doi]

2014

Exact real arithmetic for interval number systemsPetr Kurka. TCS, 542:32-43, 2014. [doi]

Analytic Functions Computable by Finite State TransducersPetr Kurka, Tomás Vávra. wia 2014: 252-263 [doi]

2013

The Unary Arithmetical Algorithm in Bimodular Number SystemsPetr Kurka, Martin Delacourt. arith 2013: 127-134 [doi]

2012

Finite State Transducers for Modular Möbius Number SystemsMartin Delacourt, Petr Kurka. mfcs 2012: 323-334 [doi]

Fast Arithmetical Algorithms in Möbius Number SystemsPetr Kurka. TC, 61(8):1097-1109, 2012. [doi]

2011

Asymptotic distribution of entry times in a cellular automaton with annihilating particlesPetr Kurka, Enrico Formenti, Alberto Dennunzio. automata 2011: 47-58 [doi]

2010

A Search Algorithm for Subshift Attractors of Cellular AutomataEnrico Formenti, Petr Kurka, Ondrej ZahradnÃk. mst, 46(3):479-498, 2010. [doi]

Erratum to: Entropy of Turing machines with moving headPetr Kurka. TCS, 411(31-33):2999-3000, 2010. [doi]

2007

A Search Algorithm for the Maximal Attractor of a Cellular AutomatonEnrico Formenti, Petr Kurka. STACS 2007: 356-366 [doi]

Cellular Automata with an Infinite Number of Subshift AttractorsPetr Kurka. compsys, 17(3), 2007. [doi]

2006

Decidability and Universality in Symbolic Dynamical SystemsJean-Charles Delvenne, Petr Kurka, Vincent D. Blondel. FUIN, 74(4):463-490, 2006. [doi]

2004

Computational Universality in Symbolic Dynamical SystemsJean-Charles Delvenne, Petr Kurka, Vincent D. Blondel. mcu 2005: 104-115 [doi]

2003

Cellular automata with vanishing particlesPetr Kurka. FUIN, 58(2003):203-221, 2003. [doi]

2002

Stability of subshifts in cellular automataPetr Kurka, Alejandro Maass. FUIN, 52(1-3):143-155, 2002. [doi]

2000

Realtime subshiftsPetr Kurka, Alejandro Maass. TCS, 237(1-2):307-325, 2000. [doi]

1999

Zero-Dimensional Dynamical Systems, Formal Languages, and UniversalityPetr Kurka. mst, 32(4):423-433, 1999. [doi]

1998

Language Complexity of Rotations and Sturmian SequencesFrançois Blanchard, Petr Kurka. TCS, 209(1-2):179-193, 1998. [doi]

1997

Cellular Automata in the Cantor, Besicovitch, and Weyl Topological SpacesFrançois Blanchard, Enrico Formenti, Petr Kurka. compsys, 11(2), 1997. [doi]

On Topological Dynamics of Turing MachinesPetr Kurka. TCS, 174(1-2):203-216, 1997. [doi]

1996

Language Complexity of Unimodal SystemsPetr Kurka. compsys, 10(4), 1996. [doi]

1994

Regular Unimodal Systems and Factors of Finite AutomataPetr Kurka. TCS, 133(1):49-64, 1994.

A Comparison of Finite and Cellular AutomataPetr Kurka. mfcs 1994: 484-493

1993

Simplicity Criteria for Dynamical SystemsPetr Kurka. ac 1995: 189-225

1986

Equitran: A computer program for analysis of a nondeterministic discrete dynamic systemPetr Kurka. kybernetika, 22(2):189-199, 1986. [doi]

1982

Ergodic LanguagesPetr Kurka. TCS, 21:351-355, 1982.

1980

On dynamic logicPetr Hájek, Pavel Kalásek, Petr Kurka. kybernetika, 16(7):1-41, 1980. [doi]

Applicability of a Production in a Categorical GrammarPetr Kurka. TCS, 10:37-44, 1980.

1977

Applicability of a Production in a Categorical GrammarPetr Kurka. fct 1977: 287-293

Sign in or sign up to see more results.

runs on WebDSL