Iterated function systems and control languages
Information and Computation
Effectively closed sets and graphs of computable real functions
Theoretical Computer Science
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Wadge Degrees of omega-Languages of Deterministic Turing Machines
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Finite Automata Encoding Geometric Figures
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
On the Power of Interactive Computing
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Fundamental study: a hierarchy of deterministic context-free ω-languages
Theoretical Computer Science
Borel hierarchy and omega context free languages
Theoretical Computer Science
On omega context free languages which are Borel sets of infinite rank
Theoretical Computer Science
Ambiguity in omega context free languages
Theoretical Computer Science
Weighted finite automata and metrics in cantor space
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Journal of Automata, Languages and Combinatorics
Automata logics, and infinite games
A topological characterization of random sequences
Information Processing Letters
Topologies for the set of disjunctive ω-words
Acta Cybernetica
Science of Computer Programming
Towards a descriptive set theory for domain-like structures
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank
Fundamenta Informaticae
On Effective Methods for Diagnosis of Retaining Faults in Circuits
Fundamenta Informaticae
Infinite unfair shuffles and associativity
Theoretical Computer Science
Finite automata encoding geometric figures
Theoretical Computer Science
The Kolmogorov complexity of infinite words
Theoretical Computer Science
On the length of the Wadge hierarchy of ω-context-free languages
Journal of Automata, Languages and Combinatorics
Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems
Fundamenta Informaticae
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Complexity of Aperiodicity for Topological Properties of Regular ω-Languages
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Complexity of Topological Properties of Regular ω-Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Theoretical Computer Science
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Decision problems for Turing machines
Information Processing Letters
Prognosis of ω-Languages for the Diagnosis of *-Languages: A Topological Perspective
Discrete Event Dynamic Systems
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
Fine hierarchy of regular aperiodic ω-languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
From norms to interaction patterns: deriving protocols for agent institutions
ProMAS'07 Proceedings of the 5th international conference on Programming multi-agent systems
Transformations of logic programs on infinite lists
Theory and Practice of Logic Programming
Joint topologies for finite and infinite words
DLT'10 Proceedings of the 14th international conference on Developments in language theory
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A CTL-based logic for program abstractions
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
A note on accelerated turing machines
Mathematical Structures in Computer Science
Theoretical Computer Science
Topological properties of forbidding-enforcing systems
Journal of Automata, Languages and Combinatorics
A semiring-semimodule generalization of transducers and abstract ω-families of power series
Journal of Automata, Languages and Combinatorics
Foundations for the run-time monitoring of reactive systems: fundamentals of the MaC language
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Model checking probabilistic systems against pushdown specifications
Information Processing Letters
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
On the Hausdorff measure of ω-power languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Learning deterministic DEC grammars is learning rational numbers
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Computation as an unbounded process
Theoretical Computer Science
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Borel ranks and wadge degrees of context free ω-languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The expressive power of analog recurrent neural networks on infinite input streams
Theoretical Computer Science
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Acceptance conditions for ω-languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems
Fundamenta Informaticae
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
On Winning Conditions of High Borel Complexity in Pushdown Games
Fundamenta Informaticae
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank
Fundamenta Informaticae
There exist some ω-powers of any Borel rank
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Regular ideal languages and their boolean combinations
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Branching-time logics with path relativisation
Journal of Computer and System Sciences
On the topological complexity of ω-languages of non-deterministic Petri nets
Information Processing Letters
| Hi-index | 0.01 |