scientific article; zbMATH DE number 3497806

Publication date 1974

Automata and formal grammars in connection with logical questions (03D05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)

Cited in

(only showing first 100 items - show all)

Powers of rationals modulo 1 and rational base number systems
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
Infinite-vertex free profinite semigroupoids and symbolic dynamics.
Self-similar tiling systems, topological factors and stretching factors
Deterministic and unambiguous two-dimensional languages over one-letter alphabet
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
About frequencies of letters in generalized automatic sequences
Characterizations of recognizable picture series
A characterization of s-languages
Lattices of local two-dimensional languages
Strongly transitive automata and the Černý conjecture
Automata theory based on complete residuated lattice-valued logic: a categorical approach
Cayley graphs as classifiers for data mining: the influence of asymmetries
An automaton-theoretic approach to the representation theory of quantum algebras
Real functions and numbers defined by Turing machines
Realisation locale des systèmes non linéaires, algèbres de Lie filtrees transitives et séries generatrices non commutatives
A note on \(\omega\)-regular languages
Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981
On the centers of a language
Rational \(\omega\)-languages are non-ambiguous
Cyclic derivation of noncommutative algebraic power series
An application of the matrix representation of transductions
The shuffle algebra on the factors of a word is free
Biprefix codes, inverse semigroups and syntactic monoids of injective automata
Polynomials associated with the characters of SU(n)
Equivalence of infinite behavior of finite automata
Langages infinitaires et produit de mixage
Codeterministic automata on infinite words
Automates boustrophédon et mots infinis
Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
Extended macro grammars and stack controlled machines
Towards a formal proof system for \(\omega\)-rational expressions
Automates finis et ensembles normaux. (Finite automata and normal sets)
A syntactic congruence for rational -languages
On infinite words obtained by selective substitution grammars
On cancellation properties of languages which are supports of rational power series
Classes of regular and context-free languages over countably infinite alphabets
Some properties of commutation in free partially commutative monoids
An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
Repetition-free words
Rational languages and the Burnside problem
Truncations of infinite matrices and algebraic series associated with some CF grammars
On coordinated selective substitutions: Towards a unified theory of grammars and machines
Systèmes codés. (Coded systems)
Infinite-word languages and continuous mappings
Petri nets with individual tokens
Addition molle et fonctions p-locales
A simple proof of the Skolem-Mahler-Lech theorem
About fair asynchrony
Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht
A note on the equivalence problem of rational formal power series
On equality of multiplicity sets of regular languages
The complementation problem for Büchi automata with applications to temporal logic
Rational equivalence relations
Finitely generated \(\omega\)-languages
Noncommutative factorization of variable-length codes
On generators of rational \(\omega\)-power languages
On regular trace languages
Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
Quasicrystal Ising chain and automata theory
Recognizing safety and liveness
On flowchart theories. II: The nondeterministic case
Easy multiplications. I: The realm of Kleene's theorem
A remark on bilinear systems and moduli spaces of instantons
Linear numeration systems of order two
Varieties of formal series on trees and Eilenberg's theorem
Iterated GSMs and CO-CFL
Expletives in languages and middle units in semigroups
Test sets for languages of infinite words
Ein Satz über die Entropie von Untermonoiden. (A theorem on the entropy of submonoids)
A closure property of regular languages
Shortest path under rational constraint
A generalization of automatic sequences
La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)
Counting with rational functions
A unified framework for disambiguating finite transductions
Concatenation of inputs in a two-way automaton
Accepting conditions for automata on -languages
A maxmin problem on finite automata
Construction of a family of finite maximal codes
Sur les entiers qui s'écrivent simplement en différentes bases. (On integers simply represented in different bases)
Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups)
Rational probability measures
Concurrent transition systems
On a conjecture of Rhodes
A necessary condition for the rationality of the zeta function of a regular language
Applications of the theory of automata in enumeration
Shuffle-compatible total orders
Every finitely generated submonoid of a free monoid has a finite Malcev's presentation
Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)
Deterministic synchronization of automata with bounded delay
Shuffle on trajectories: Syntactic constraints
Le degré minimal du groupe d'un code biprefixe fini
Sur le théorème du defaut
On some properties of very pure codes
La représentation ergodique d'un automate fini
A cyclic derivative in noncommutative algebra
Partially additive categories and flow-diagram semantics
One-way weak-stack-counter automata
Rational bijection of rational sets

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)