scientific article; zbMATH DE number 3497806
From MaRDI portal
Publication:4079524
zbMATH Open0317.94045MaRDI QIDQ4079524FDOQ4079524
Authors: Samuel Eilenberg
Publication date: 1974
Title of this publication is not available (Why is that?)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Automata and formal grammars in connection with logical questions (03D05)
Cited In (only showing first 100 items - show all)
- Notes on finite asynchronous automata
- Automatic congruences for diagonals of rational functions
- Automata-theoretic semantics of idealized Algol with passive expressions
- Varieties and covarieties of languages (extended abstract)
- Smooth finitely computable functions are affine, or why quantum systems cause waves
- Hierarchies and reducibilities on regular languages related to modulo counting
- Free inductive \(K\)-semialgebras
- Path sets in one-sided symbolic dynamics
- Free iterative and iteration \(K\)-semialgebras
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata
- Model-theoretic complexity of automatic structures
- On vanishing coefficients of algebraic power series over fields of positive characteristic
- One-unambiguous regular languages
- Identifying all preorders on the subdistribution monad
- Hyperquadratic continued fractions and automatic sequences
- The growth function of \(S\)-recognizable sets
- Petri nets with individual tokens
- The ring of \(k\)-regular sequences
- Noncommutative minimization algorithms
- On the limit set of some universal cellular automata
- On groups whose word problem is solved by a counter automaton.
- Finite automata theory with membership values in lattices
- Title not available (Why is that?)
- About frequencies of letters in generalized automatic sequences
- A characterization of substitutive sequences using return words
- The equational logic of fixed points
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Distance desert automata and the star height problem
- On syntactic nuclei of rational languages
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- On the recognizability of fuzzy languages. II
- On the recognizability of fuzzy languages. I
- Distances between languages and reflexivity of relations
- Eigenvalues of Fibonacci stochastic adding machine
- On recognizable sets of integers
- Testing data processing-oriented systems from stream X-machine models
- Myhill-Nerode type theory for fuzzy languages and automata
- Checking experiments for stream X-machines
- Determinization of weighted finite automata over strong bimonoids
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- The ring of \(k\)-regular sequences. II.
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Combinatorial aspects of continued fractions
- Triangular norm-based measures and their Markov kernel representation
- Equational properties of Kleene algebras of relations with conversion
- Lexicographic decomposition of \(k\)-valued transducers
- Presentations of inverse monoids
- Systèmes codés. (Coded systems)
- Characterizations of fuzzy finite automata.
- Finite \(L\)-fuzzy machines.
- Finite state wreath powers of transformation semigroups.
- On the vector space of the automatic reals
- Morphismes unispectraux. (Unispectral morphisms)
- \(\beta\)-expansions and symbolic dynamics
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- The group of asynchronous automata and rational homeomorphisms of the Cantor set
- The origins of combinatorics on words
- Parallel language recognition in constant time by cellular automata
- Construction of fuzzy automata from fuzzy regular expressions
- Comparability graphs and a new matroid
- On finite semigroups of matrices
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
- Axiomatizing rational power series over natural numbers
- Notes on equational theories of relations
- Alternating finite automata on \(\omega\)-words
- Recognizable picture languages and domino tiling
- An extension of Kleene's and Ochmański's theorems to infinite traces
- Series-parallel languages and the bounded-width property
- Words and forbidden factors
- Polynomial closure and unambiguous product
- Automates finis et ensembles normaux. (Finite automata and normal sets)
- On the automorphism group of the one-rooted binary tree
- Syndeticity and independent substitutions
- Groups and semigroups defined by colorings of synchronizing automata.
- Forbidden words in symbolic dynamics
- Membership problems for regular and context-free trace languages
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles
- Testing against a non-controllable stream X-machine using state counting
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Logic, semigroups and automata on words
- Decomposing a $k$-valued transducer into $k$ unambiguous ones
- Bisimulation relations for weighted automata
- Limit sets of automatic sequences.
- Recognizable subsets of some partially Abelian monoids
- On quotients of formal power series
- AUTOMATE, a computing package for automata and finite semigroups
- On the Decidability of the Equivalence for k-Valued Transducers
- Algebraic recognizability of regular tree languages
- The monadic quantifier alternation hierarchy over grids and graphs
- Suites algébriques, automates et substitutions
- EURACE: A massively parallel agent-based model of the European economy
- Automata and languages generalized to \(\omega\)-continuous semirings
- On Conjugacy of Languages
- Sequential?
- On semigroups of matrices over the tropical semiring
- Weak Second‐Order Arithmetic and Finite Automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4079524)