About: Formal languages and automata

Documentation

scienceplus.abes.fr version Bêta

scienceplus.abes.fr | explorer

À propos de : Formal languages and automata Goto Sponge NotDistinct Permalink

Attributs	Valeurs
type	Concept
rdfs:seeAlso	Automata and formal grammars in connection with logical questions Algebraic theory of languages and automata Prefix, length-variable, comma-free codes
skos:inScheme	MSC 2010
broader concept	Theory of computing
skos:prefLabel	Formal languages and automata Linguaggi formali ed automi 形式语言和自动机
skos:exactMatch	http://msc2010.org/resources/MSC/2000/68Q45
skos:altLabel	Linguaggi formali ed automi [Vedi anche 03D05, 68Q70, 94A45] Formal languages and automata [See also 03D05, 68Q70, 94A45] 形式语言和自动机[参见03D05, 68Q70, 94A45]
http://msc2010.org...0/msc2010#seeAlso	Automata and formal grammars in connection with logical questions Algebraic theory of languages and automata Prefix, length-variable, comma-free codes
skos:closeMatch	from MSC1991 value of: Formal languages, [See also 03D05, 20M35, 94A45]
skos:notation	68Q45
skos:note	See also 03D05, 68Q70, 94A45.
skos:relatedMatch	http://msc2010.org/resources/MSC/2010/fullDD21-005.131
skos:semanticRelation	Automata and formal grammars in connection with logical questions Algebraic theory of languages and automata Prefix, length-variable, comma-free codes
is rdfs:seeAlso of	Automata and formal grammars in connection with logical questions Prefix, length-variable, comma-free codes
is Subject of	Lower Space Bounds for Accepting Shuffle Languages A characterization of poly-slender context-free languages Similarity relations and cover automata On a complete set of operations for factorizing codes A pumping lemma for flip-pushdown languages On synchronized sequences and their separators Weightreducing grammars and ultralinear languages Comparing the succinctness of monadic query languages over finite trees On context-free rewriting with a simple restriction and its computational completeness Tree Automata and Automata on Linear Orderings CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store Conversion of regular expressions into realtime automata Hopcroft's algorithm and tree-like automata Cohesiveness in promise problems A general framework for the derivation of regular expressions Root clustering of words A Kleene-Schützenberger theorem for Lindenmayerian rational power series Semi-commutations and Partial commutations A Space Lower Bound for Acceptance by One-Way Π 2-Alternating Machines Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata Algebraic and graph-theoretic properties of infinite n-posets Efficient simulation of synchronous systems by multi-speed systems Series which are both max-plus and min-plus rational are unambiguous Nested Sibling Tree Automata On possible growths of arithmetical complexity Squares and overlaps in the Thue-Morse sequence and some variants Sequential monotonicity for restarting automata Binary operations on automatic functions Formal language properties of hybrid systems with strong resets Corrigendum to our paper: How Expressions Can Code for Automata k-counting automata Systems of parallel communicating restarting automata One-Rule Length-Preserving Rewrite Systems and Rational Transductions Bouquets of circles for lamination languages and complexities One quantifier alternation in first-order logic with modular predicates Two-way representations and weighted automata Quantum finite automata with control language State complexity of cyclic shift A Hierarchy of Automatic ω-Words having a Decidable MSO Theory A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata Traces of term-automatic graphs Superiority of one-way and realtime quantum machines Generating Networks of Splicing Processors Unambiguous recognizable two-dimensional languages Decision algorithms for Fibonacci-automatic Words, I: Basic results Delay Games with WMSO +U Winning Conditions Automata, Borel functions and real numbers in Pisot base Efficient weighted expressions conversion Kleene closure and state complexity Deterministic blow-ups of minimal NFA's Learning tree languages from text An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid Classes of two-dimensional languages and recognizability conditions Regularity of languages defined by formal series with isolated cut point The finiteness problem for monoids of morphisms Optimal strategy synthesis for request-response games Probabilistic models for pattern statistics Decision problems among the main subfamilies of rational relations String distances and intrusion detection: Bridging the gap between formal languages and computer security A little more about morphic Sturmian words D0L sequence equivalence is in P for fixed alphabets On Varieties of Literally Idempotent Languages Polynomial languages with finite antidictionaries Translation from classical two-way automata to pebble two-way automata Strategies to scan pictures with automata based on Wang tiles Construction of tree automata from regular expressions Normal forms for unary probabilistic automata Decidability of the HD 0L ultimate periodicity problem An upper bound on the complexity of recognizable tree languages Well quasi-orders, unavoidable sets, and derivation systems Deciding inclusion of set constants over infinite non-strict data structures Returning and non-returning parallel communicating finite automata are equivalent A periodicity property of iterated morphisms Decidability of code properties Uniformly bounded duplication codes

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata