Jirí Síma

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 20

Top Topics

Regular Languages

Finite State Automaton

Top Venues

Neural Networks

Fundam. Informaticae

Publications

Jirí Síma, Jérémie Cabessa, Petra Vidnerová
On energy complexity of fully-connected layers. Neural Networks 178 (2024)
Jirí Síma, Jérémie Cabessa
Energy Complexity of Fully-Connected Layers. IWANN (1) (2023)
Jirí Síma
Stronger separation of analog neuron hierarchy by deterministic context-free languages. Neurocomputing 493 (2022)
Petr Jancar, Jirí Síma
Simplest Non-Regular Deterministic Context-Free Language. CoRR (2021)
Jirí Síma
Stronger Separation of Analog Neuron Hierarchy by Deterministic Context-Free Languages. CoRR (2021)
Jirí Síma, Stanislav Zák
A polynomial time construction of a hitting set for read-once branching programs of width 3. CoRR (2021)
Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa, Jirí Síma
On Separations of LR(0)-Grammars by Two Types of Pumping Patterns. ITAT (2021)
Petr Jancar, Jirí Síma
The Simplest Non-Regular Deterministic Context-Free Language. MFCS (2021)
Jirí Síma, Stanislav Zák
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3. Fundam. Informaticae 184 (4) (2021)
Jirí Síma
Analog neuron hierarchy. Neural Networks 128 (2020)
Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma
Pumping Deterministic Monotone Restarting Automata and DCFL. ITAT (2020)
Jirí Síma, Martin Plátek
One Analog Neuron Cannot Recognize Deterministic Context-Free Languages. ICONIP (3) (2019)
Jirí Síma
Counting with Analog Neurons. ICANN (1) (2019)
Jérémie Cabessa, Jirí Síma
Robust Optimal-Size Implementation of Finite State Automata with Synfire Ring-Based Neural Networks. ICANN (1) (2019)
Jirí Síma
Subrecursive neural networks. Neural Networks 116 (2019)
Jirí Síma, Petr Savický
-expansions and cut languages. Theor. Comput. Sci. 720 (2018)
Jirí Síma
Three Analog Neurons Are Turing Universal. TPNC (2018)
Jirí Síma
Neural networks between integer and rational weights. IJCNN (2017)
Jirí Síma, Stanislav Zák
On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity. Fundam. Informaticae 152 (4) (2017)
Jirí Síma, Petr Savický
Cut Languages in Rational Bases. LATA (2017)
Jirí Síma
Energy Complexity of Recurrent Neural Networks. Neural Comput. 26 (5) (2014)
Jirí Síma
The Power of Extra Analog Neuron. TPNC (2014)
Jirí Síma
A Low-Energy Implementation of Finite Automata by Optimal-Size Neural Nets. ICANN (2013)
Stanislav Zák, Jirí Síma
A Turing Machine Distance Hierarchy. LATA (2013)
Jirí Síma, Stanislav Zák
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract). SOFSEM (2012)
Jirí Síma, Stanislav Zák
-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs. CSR (2011)
Jirí Síma, Stanislav Zák
A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3. Electron. Colloquium Comput. Complex. 17 (2010)
Jirí Síma, Radim Lnenicka
Sequential Triangle Strip Generator Based on Hopfield Networks. Neural Comput. 21 (2) (2009)
Jirí Síma
Gradient Learning in Networks of Smoothly Spiking Neurons. ICONIP (2) (2008)
Jirí Síma, Stanislav Zák
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3. SOFSEM (1) (2007)
Jirí Síma, Satu Elisa Schaeffer
On the NP-Completeness of Some Graph Cluster Measures. SOFSEM (2006)
Jirí Síma, Satu Elisa Schaeffer
On the NP-Completeness of Some Graph Cluster Measures CoRR (2005)
Jirí Síma, Jirí Sgall
On the Nonlearnability of a Single Spiking Neuron. Neural Comput. 17 (12) (2005)
Jirí Síma
Optimal Triangle Stripifications as Minimum Energy States in Hopfield Nets. ICANN (1) (2005)
Michal Sorel, Jirí Síma
Robust RBF finite automata. Neurocomputing 62 (2004)
Jirí Síma, Pekka Orponen
Continuous-Time Symmetric Hopfield Nets Are Computationally Universal. Neural Comput. 15 (3) (2003)
Jirí Síma, Pekka Orponen
Exponential transients in continuous-time Liapunov systems. Theor. Comput. Sci. 306 (1-3) (2003)
Jirí Síma
On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays. ALT (2003)
Jirí Síma, Pekka Orponen
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results. Neural Comput. 15 (12) (2003)
Jirí Síma
Training a Single Sigmoidal Neuron Is Hard. Neural Comput. 14 (11) (2002)
Jirí Síma
Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard. ALT (2001)
Jirí Síma, Pekka Orponen
Computing with continuous-time Liapunov systems. STOC (2001)
Jirí Síma, Pekka Orponen, Teemu Antti-Poika
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets. Neural Comput. 12 (12) (2001)
Jirí Síma, Pekka Orponen
Exponential Transients in Continuous-Time Symmetric Hopfield Nets. ICANN (2001)
Michal Sorel, Jirí Síma
Robust Implementaion of Finite Automata by Recurrent RBF Networks. SOFSEM (2000)
Jirí Síma
Table Rounding Problem. Comput. Artif. Intell. 18 (2) (1999)
Jirí Síma, Pekka Orponen, Teemu Antti-Poika
Some Afterthoughts on Hopfield Networks. SOFSEM (1999)
Jirí Síma, Jirí Wiedermann
Theory of Neuromata. J. ACM 45 (1) (1998)
Jirí Síma
Aunt's Problem: Table Rounding. SOFSEM (1996)
Jirí Síma
Back-propagation is not Efficient. Neural Networks 9 (6) (1996)
Jirí Síma, Jirí Wiedermann
Neural Language Acceptors. Developments in Language Theory (1995)
Jirí Síma
Hopfield Languages. SOFSEM (1995)
Jirí Síma
Neural expert systems. Neural Networks 8 (2) (1995)
Jirí Síma
Loading Deep Networks Is Hard. Neural Comput. 6 (5) (1994)