Extensions to communicating sequential processes to allow protocol performance specification
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
The Analysis of the Faulty Behavior of Synchronous Neural Networks
IEEE Transactions on Computers - Special issue on artificial neural networks
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Predicting Protein Secondary Structure Using Stochastic Tree Grammars
Machine Learning - Special issue on learning with probabilistic representations
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Finding Optimal Demand Paging Algorithms
Journal of the ACM (JACM)
Stochastic sequential machine synthesis with application to constrained sequence generation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Distribution functions of probabilistic automata
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Forty years of formal power series in automata theory
A half-century of automata theory
The parallel complexity of deterministic and probabilistic automata
Journal of Automata, Languages and Combinatorics
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Probabilistic Temporal Logics via the Modal Mu-Calculus
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
On the probability of deadlock in computer systems
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
On the undecidability of probabilistic planning and related stochastic optimization problems
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Inequality of finite behaviors of rational weight finite automata is in R
Information Processing Letters
On the simulation of quantum Turing machines
Theoretical Computer Science
Automata theory based on quantum logic: some characterizations
Information and Computation
On probabilistic analog automata
Theoretical Computer Science
Weak minimization of DFA: an algorithm and applications
Theoretical Computer Science - Implementation and application of automata
Probabilistic Finite-State Machines-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
Weighted rational transductions and their application to human language processing
HLT '94 Proceedings of the workshop on Human Language Technology
On probabilistic program equivalence and refinement
CONCUR 2005 - Concurrency Theory
Small size quantum automata recognizing some regular languages
Theoretical Computer Science - The art of theory
A General Technique to Train Language Models on Language Models
Computational Linguistics
Rule Extraction from Recurrent Neural Networks: A Taxonomy and Review
Neural Computation
Probabilistic temporal logics via the modal mu-calculus
Theoretical Computer Science
Determination of equivalence between quantum sequential machines
Theoretical Computer Science
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Equivalence in automata theory based on complete residuated lattice-valued logic
Fuzzy Sets and Systems
The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx
Neural Computation
Applying Probability Measures to Abstract Languages
IEEE Transactions on Computers
Inference of Finite-State Probabilistic Grammars
IEEE Transactions on Computers
Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages
IEEE Transactions on Computers
An Optimal Illumination Region Algorithm for Convex Polygons
IEEE Transactions on Computers
WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
Theoretical Computer Science
The theory of trackability with applications to sensor networks
ACM Transactions on Sensor Networks (TOSN)
Computation of distances for regular and context-free probabilistic languages
Theoretical Computer Science
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Automata, Probability, and Recursion
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Various Aspects of Finite Quantum Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Reasoning about actions with sensing under qualitative and probabilistic uncertainty
ACM Transactions on Computational Logic (TOCL)
Note: A note on quantum sequential machines
Theoretical Computer Science
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
Finite State Models for the Generation of Large Corpora of Natural Language Texts
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Hierarchy and equivalence of multi-letter quantum finite automata
Theoretical Computer Science
Qualitative Concurrent Stochastic Games with Imperfect Information
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Approximation of fuzzy context-free grammars
Information Sciences: an International Journal
The Effect of Tossing Coins in Omega-Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Power of Randomization in Automata on Infinite Strings
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Languages Recognized with Unbounded Error by Quantum Finite Automata
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
IEEE Transactions on Computers
Complexity of probabilistic planning under average rewards
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A probabilistic approach to navigation in Hypertext
Information Sciences: an International Journal
A new family of nonstochastic languages
Information Processing Letters
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Computation with absolutely no space overhead
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Residual languages and probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Learning languages with rational kernels
COLT'07 Proceedings of the 20th annual conference on Learning theory
Average value and variance of pattern statistics in rational models
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
On decision problems for probabilistic Büchi automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
ACM Transactions on Computational Logic (TOCL)
Solving simple stochastic tail games
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Probabilistic automata on finite words: decidable and undecidable problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On the joint spectral radius for bounded matrix languages
RP'10 Proceedings of the 4th international conference on Reachability problems
Algorithmic aspects of natural language processing
Algorithms and theory of computation handbook
Qualitative analysis of partially-observable Markov decision processes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Behaviours of Unary Quantum Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Probabilistic automata on infinite words: decidability and undecidability results
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
On model checking techniques for randomized distributed systems
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Recurrence and transience for finite probabilistic tables
Theoretical Computer Science
Probabilistic Büchi automata with non-extremal acceptance thresholds
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
Language equivalence for probabilistic automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Infinite synchronizing words for probabilistic automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Ergodicity Coefficients Defined by Vector Norms
SIAM Journal on Matrix Analysis and Applications
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Journal of the ACM (JACM)
Characterizations of one-way general quantum finite automata
Theoretical Computer Science
On the computation of some standard distances between probabilistic automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Applying conditional random fields to chinese shallow parsing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Analysis of recursive probabilistic models
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
On probabilistic and quantum reaction systems
Theoretical Computer Science
Quantum automata theory – a review
Algebraic Foundations in Computer Science
Rich set of features for proper name recognition in polish texts
SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
Finding the most probable string and the consensus string: an algorithmic study
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata
Theoretical Computer Science
Interval probabilities of state transitions in probabilistic automata
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Parallel quantum algorithm for finding the consistency of saaty's matrices
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Partial-Observation Stochastic Games: How to Win When Belief Fails
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Decidable Problems for Probabilistic Automata on Infinite Words
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Deciding the Value 1 Problem for Probabilistic Leaktight Automata
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the Size of Unary Probabilistic and Nondeterministic Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Probabilistic automata and probabilistic logic
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
On the complexity of minimizing probabilistic and quantum automata
Information and Computation
Probabilistic automata for computing with words
Journal of Computer and System Sciences
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Diagnosability in concurrent probabilistic systems
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
A general technique to train language models on language models
Computational Linguistics
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
Optimally solving dec-POMDPs as continuous-state MDPs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A consensual linear opinion pool
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A survey of partial-observation stochastic parity games
Formal Methods in System Design
Solving Partial-Information Stochastic Parity Games
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Decision Problems for Probabilistic Finite Automata on Bounded Languages
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.03 |