Algebraic decision procedures for local testability
From MaRDI portal
Publication:4773689
Cites work
Cited in
(58)- Locality and Centrality: The Variety ZG
- The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin
- Relativized adjacency
- Measuring power of generalised definite languages
- On some decision problems for stateless deterministic ordered restarting automata
- Languages and scanners
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- On stateless two-pushdown automata and restarting automata
- \(NC^ 1\): The automata-theoretic viewpoint
- La finitude des représentations linéaires des semi-groupes est decidable
- Right and left locally testable languages
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- Over testable languages
- Semigroups and languages of dot-depth two
- Languages of dot-depth 3/2
- The Burnside problem for semigroups
- Properties of code events and homomorphisms over regular events
- Families of locally testable languages
- Finite semigroup varieties of the form V*D
- Hierarchies and reducibilities on regular languages related to modulo counting
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
- Group-complexity and reversals of finite semigroups
- Inclusion relations between some congruences related to the dot-depth hierarchy
- Strongly locally testable semigroups with commuting idempotents and related languages
- Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
- Locally testable semigroups
- On generalized locally testable languages
- String assembling systems: comparison to sticker systems and decidability
- Measuring power of locally testable languages
- An efficient algorithm for local testability problem of finite state automata
- Biinfinite words with maximal recurrent unbordered factors.
- The covering problem
- Tameness of joins involving the pseudovariety of local semilattices.
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.
- The expressivity of autosegmental grammars
- A Note on Decidable Separability by Piecewise Testable Languages
- Games, equations and the dot-depth hierarchy
- The product of rational languages
- TAMENESS OF THE PSEUDOVARIETY LS1
- The varieties of n-testable semigroups
- Local testability from words to traces, a suitable definition
- Logic, semigroups and automata on words
- Free profinite \(\mathcal R\)-trivial, locally idempotent and locally commutative semigroups
- LANGAGE: A Maple package for automaton characterization of regular languages
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)
- The Karoubi envelope of the mirage of a subshift
- Grammatical inference of directed acyclic graph languages with polynomial time complexity
- Free profinite locally idempotent and locally commutative semigroups
- Locally testable languages
- Learning \((k,l)\)-contextual tree languages for information extraction from web pages
- scientific article; zbMATH DE number 3682031 (Why is no real title available?)
- On bases of identities for the \(\omega\)-variety generated by locally testable semigroups.
- Expressive power of existential first-order sentences of Büchi's sequential calculus
- GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE
- Left and right negatively orderable semigroups and a one-sided version of Simon's theorem
- On the descriptional complexity of stateless deterministic ordered restarting automata
- Sublinear-time language recognition and decision by one-dimensional cellular automata
- Products of languages with counter
This page was built for publication: Algebraic decision procedures for local testability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4773689)
