The Theory of Definite Automata

DOI10.1109/PGEC.1963.263534zbMath0158.01002OpenAlexW2085118356MaRDI QIDQ5540449

No author found.

Publication date: 1963

Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/pgec.1963.263534

zbMATH Keywords

mathematical logic

Related Items (39)

A tight linear bound on the synchronization delay of bijective automata ⋮ P(l)aying for Synchronization ⋮ Resetting words for decidable automata ⋮ Definite and Quasidefinite Sets of Stochastic Matrices ⋮ On probabilistic analog automata ⋮ Aspects of Reversibility for Classical Automata ⋮ La représentation ergodique d'un automate fini ⋮ Expressive Capacity of Concatenation Freeness ⋮ Number of labelings of definite automata graphs ⋮ Reset words for commutative and solvable automata ⋮ An interconnection of local maps inducing onto global maps ⋮ The labeling graphs of definite automata ⋮ Merging two hierarchies of external contextual grammars with subregular selection ⋮ String matching algorithms and automata ⋮ Relations of contextual grammars with strictly locally testable selection languages ⋮ Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order ⋮ On the acceptance power of regular languages ⋮ On the smoothness of paging algorithms ⋮ SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY ⋮ On Rough Approximations of Languages under Infinite Index Indiscernibility Relations ⋮ Remarks on external contextual grammars with selection ⋮ Constant-to-one and onto global maps of homomorphisms between strongly connected graphs ⋮ A trichotomy for regular simple path queries on graphs ⋮ Synchronizing automata with finitely many minimal synchronizing words ⋮ Determination of finite automata accepting subregular languages ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Local maps inducing surjective global maps of one-dimensional tessellation automata ⋮ Finitely Generated Synchronizing Automata ⋮ General varieties of tree languages ⋮ On the bound of the synchronization delay of a local automaton ⋮ Locally testable languages ⋮ Characterizations of locally testable events ⋮ Optimal estimation on the order of local testability of finite automata ⋮ Closure properties of subregular languages under operations ⋮ Algebraic decision procedures for local testability ⋮ Concatenation-free languages

This page was built for publication: The Theory of Definite Automata