scientific article

Publication date: 9 December 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (62)

Operations preserving regular languages ⋮ Dynamical directions in numeration ⋮ Degrees of Transducibility ⋮ The Degree of Squares is an Atom ⋮ Surminimisation of Automata ⋮ Weighted finite automata over strong bimonoids ⋮ Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable ⋮ Rational and Recognisable Power Series ⋮ Unnamed Item ⋮ Convolution and concurrency ⋮ The growth ratio of synchronous rational relations is unique ⋮ Transducer degrees: atoms, infima and suprema ⋮ Multi-grain Relations ⋮ Weighted iterated linear control ⋮ Properties and limits of recognition of sets of integers by countable automata ⋮ General Framework ⋮ Word-mappings of level 2 ⋮ Computational power of two stacks with restricted communication ⋮ Well Quasi-orders in Formal Language Theory ⋮ On the Decidability of the Equivalence for k-Valued Transducers ⋮ Construction of Tree Automata from Regular Expressions ⋮ Management and analysis of DNA microarray data by using weighted trees ⋮ ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ Completing circular codes in regular submonoids ⋮ Weighted automata with discounting ⋮ Parsing with a finite dictionary ⋮ Sturmian trees ⋮ Introducing VAUCANSON ⋮ On the structure of the counting function of sparse context-free languages. ⋮ Computing by commuting. ⋮ Sequential? ⋮ Completing prefix codes in submonoids. ⋮ Derivatives of rational expressions with multiplicity ⋮ Representing real numbers in a generalized numeration system ⋮ How expressions can code for automata ⋮ A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems ⋮ Unnamed Item ⋮ Complementation of Branching Automata for Scattered and Countable N-Free Posets ⋮ Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) ⋮ Automata, Borel functions and real numbers in Pisot base ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ Enumeration and random generation of accessible automata ⋮ On the separability of sparse context-free languages and of bounded rational relations ⋮ The signature of rational languages ⋮ Completing codes in a sofic shift ⋮ Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. ⋮ Series which are both max-plus and min-plus rational are unambiguous ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ Free monoids and generalized metric spaces ⋮ A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS ⋮ Quasi-polynomials, linear Diophantine equations and semi-linear sets ⋮ Arithmetic and \(k\)-maximality of the cyclic free magma ⋮ The Parikh counting functions of sparse context-free languages are quasi-polynomials ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ Arithmetic Meyer sets and finite automata ⋮ Decision problems among the main subfamilies of rational relations ⋮ Unambiguous recognizable two-dimensional languages ⋮ Compositions of (max,+) automata ⋮ Non-commutative double-sided continued fractions ⋮ On the Balancedness of Tree-to-Word Transducers ⋮ An Exercise on Fibonacci Representations

This page was built for publication: