Branislav Rovan

Orcid: 0000-0002-0015-403X

According to our database1, Branislav Rovan authored at least 30 papers between 1969 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Usefulness of information and decomposability of unary regular languages.
Inf. Comput., December, 2023

2022
Finite Approximations and Similarity of Languages.
Int. J. Found. Comput. Sci., 2022

2021
Usefulness of Information and Unary Languages.
Proceedings of the Language and Automata Theory and Applications, 2021

2020
Descriptional Complexity of Push Down Automata.
Proceedings of the 20th Conference Information Technologies, 2020

2018
On Usefulness of Information: Framework and NFA Case.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2016
Automata with Auxiliary Weights.
Int. J. Found. Comput. Sci., 2016

2014
Modeling time criticality of information.
Inf. Process. Lett., 2014

2011
Simplifying DPDA Using Supplementary Information.
Proceedings of the Language and Automata Theory and Applications, 2011

2009
Infinite Computations and a Hierarchy in Delta<sub>3</sub> Reconsidered.
J. Log. Comput., 2009

2008
Assisted Problem Solving and Decompositions of Finite Automata.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2007
A Transducer-Based Framework for Streaming XML Transformations.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007


Infinite Computations and a Hierarchy in <i>Delta</i> <sub>3</sub>.
Proceedings of the Computation and Logic in the Real World, 2007

2005
Introduction - Combined TCSA/TCSB issue - mathematical foundations of computer science 2000.
Theor. Comput. Sci., 2005

2001
Eliminating Communication by Parallel Rewriting.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

1999
On the history of computer science, computer engineering, and computer technology development in Slovakia.
IEEE Ann. Hist. Comput., 1999

Interval Routing on Layered Cross Product of Trees and Cycles.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

1997
On Partitioning Grids into Equal Parts.
Comput. Artif. Intell., 1997

1996
Introduction: Selected Papers of MFCS 1994.
Theor. Comput. Sci., 1996

1995
Time-Bounded Parallel Rewriting.
Proceedings of the Developments in Language Theory II, 1995

1994
Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Theor. Comput. Sci., 1994

1992
On the Power of One-Way Synchronized Alternating Machines with Small Space.
Int. J. Found. Comput. Sci., 1992

1991
On the power of synchronization in parallel computations.
Discret. Appl. Math., 1991

1989
On the Power of Synchronization in Parallel Computations.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1981
A Framework for Studying Grammars.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1975
Proving Containment of Bounded AFL.
J. Comput. Syst. Sci., 1975

1974
On the Periodicity of Word-Length in DOL Languages
Inf. Control., September, 1974

1973
Necessary Conditions for Containment of Principal (Semi-)AFL with Bounded Generators.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1969
Bounded push down automata.
Kybernetika, 1969


  Loading...