scientific article; zbMATH DE number 1142311
From MaRDI portal
zbMath0900.68312MaRDI QIDQ4385527
Publication date: 14 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the expressive power of temporal logic, The full quotient and its closure property for regular languages, Strongly connected synchronizing automata and the language of minimal reset words, Rewriting regular inequalities, Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations, Constants and label-equivalence: a decision procedure for reflexive regular splicing languages, Automata on linear orderings, Distance desert automata and the star height problem, Representation of (Left) Ideal Regular Languages by Synchronizing Automata, An equational axiomatization for multi-exit iteration, Enumerative sequences of leaves in rational trees, Monadic simultaneous rigid E-unification and related problems, Bertrand numeration systems and recognizability, On the factors of automatic words, Optimal insertion in deterministic DAWGs, On images of D0L and DT0L power series., On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases, Matrix Code, Monadic simultaneous rigid \(E\)-unification, On the representation of finite deterministic 2-tape automata, From Combinatorial Games to Shape-Symmetric Morphisms, Monadic partition logics and finite automata, Rewriting extended regular expressions, Kernel methods for learning languages, Theme and Variations on the Concatenation Product, Computable fixpoints in well-structured symbolic model checking, On Simon's string searching algorithm, The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable, Regular splicing languages and subclasses, Parsing with a finite dictionary, Deciding whether a finite set of words has rank at most two, One-unambiguous regular languages, One-unambiguous regular languages, Acyclic networks maximizing the printing complexity, A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number, Finite language forbidding-enforcing systems, Linear splicing and syntactic monoid, It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base, The structure of reflexive regular splicing languages via Schützenberger constants, Syntactic complexity of regular ideals, Subset construction complexity for homogeneous automata, position automata and ZPC-structures, Automata on infinite trees with counting constraints, Most Complex Non-Returning Regular Languages, Reset Complexity of Ideal Languages Over a Binary Alphabet, Matching Trace Patterns with Regular Policies, A Kleene Theorem for Forest Languages, On number systems with finite degree of ambiguity, Clausal Tableaux for Hybrid PDL, A probabilistic approach to navigation in Hypertext, On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based, A construction on finite automata that has remained hidden, Weighted automata and multi-valued logics over arbitrary bounded lattices, Deterministic generalized automata, Families of locally testable languages, Alternating finite automata and star-free languages, Minimization algorithms for sequential transducers, On the power of circular splicing, Wreath product and infinite words, Temporal connectives versus explicit timestamps to query temporal databases, A unified language processing methodology, Logic over words on denumerable ordinals
