scientific article
From MaRDI portal
Publication:3742754
zbMath0605.68080MaRDI QIDQ3742754
Oscar H. Ibarra, Bala Ravikumar
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Polynomially ambiguous probabilistic automata on restricted languages, Analytic models and ambiguity of context-free languages, When is an automatic set an additive basis?, Unboundedness problems for machines with reversal-bounded counters, On the Commutative Equivalence of Algebraic Formal Series and Languages, Decision Questions for Probabilistic Automata on Small Alphabets, \(F\)-sets and finite automata, A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata, Comparing Complexity Functions of a Language and Its Extendable Part, Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time, On bounded linear codes and the commutative equivalence, The monoids of the patience sorting algorithm, On the commutative equivalence of bounded context-free and regular languages: the code case, Operations on Unambiguous Finite Automata, On the degree of ambiguity of finite automata, The parallel complexity of finite-state automata problems, Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity, On the structure of the counting function of sparse context-free languages., Descriptional and computational complexity of finite automata -- a survey, Unnamed Item, Unnamed Item, Descriptional and Computational Complexity of Finite Automata, Operations on Unambiguous Finite Automata, Effective entropies and data compression, Polynomially Ambiguous Probabilistic Automata on Restricted Languages, Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring, The Parikh counting functions of sparse context-free languages are quasi-polynomials, Consistently-detecting monitors, Communication complexity method for measuring nondeterminism in finite automata, A refinement of Christol's theorem for algebraic power series
