Tag: automata-theory

24 Automatic groups - recent progress 2010-01-07T09:36:47.850

12 Complementation of $\omega$-regular languages in reverse mathematics 2011-03-08T14:18:38.750

11 Eilenberg's rational hiererchy of nonrational automata & languages — where is it now? 2012-02-22T14:41:27.497

11 Unique words in dihedral groups 2017-08-14T03:04:08.477

10 Regular languages and the pumping lemma 2009-10-20T04:21:08.150

9 Generating function of a regular language 2013-01-18T22:45:49.787

8 Is Post's tag system solved? 2018-11-28T02:31:53.360

7 Wolfram's 2-state 3-symbol Turing machine 2010-07-26T07:48:12.067

7 Can you hide a letter without losing information? 2011-09-25T14:09:26.973

7 Is there an algorithm that can "reverse engineer" a Regular Expression? 2012-05-26T03:38:44.267

7 Isomorphism in category of finite automata 2013-10-04T05:35:40.543

6 Growth zeta-functions of regular languages 2011-06-21T19:40:50.330

6 Rabin's Tree Theorem 2012-05-16T21:06:08.010

6 Generalising the adherence operator and its closure properties with regard to regular (rational) languages 2014-01-07T10:32:37.513

6 Separating infinite words sharing factors by automata 2014-01-15T11:02:47.897

6 Computing the pro-solvable closure of a finitely generated subgroup of a free group 2014-02-05T15:13:06.067

6 Deterministic finite-state automaton driven by a Markov chain 2014-12-21T17:01:05.377

6 Neighbourhood of a word and Levenshtein distance 2016-05-11T14:14:44.537

6 Embedding Turing machine 2018-10-21T06:59:06.173

5 "Question-answer" bisimulation 2010-07-16T14:50:20.847

5 A special class of regular languages: "circular" languages. Is it known? 2011-01-11T14:54:42.263

5 Büchi automata with acceptance strategy 2012-05-15T14:51:05.440

5 Is it decidable whether the support of a rational $\mathbb{Z}$-series is a regular language? 2013-08-18T12:07:58.490

5 K-fellow traveler property and automatic structure 2015-05-18T15:58:27.193

5 Rabin's proofs of emptiness and complementation problems for automata on infinite trees 2017-01-19T14:08:00.490

4 Are context-free languages with context-free complements necessarily deterministic context-free? 2012-02-21T21:46:23.483

4 connectivity in automata by words of length n-1 2012-04-03T18:15:50.323

4 How should one generate a random set of mappings? 2012-05-26T13:35:23.957

4 Deciding equivalence of regular languages 2012-09-11T12:34:53.350

4 Properties of classical automata preserved in Büchi automata 2013-02-21T16:43:45.257

4 Computations with conetypes of hyperbolic groups 2015-09-22T14:06:55.767

4 A problem on automatic groups and geodesic paths on the Cayley graph 2016-09-06T20:00:13.067

4 Giving the same concept different names in the same paper 2016-10-17T14:06:24.270

3 Theory mainly concerned with $\lambda$-calculus? 2010-01-15T11:08:24.867

3 'Closure' of CFLs under complementation and intersection 2011-01-10T14:46:23.897

3 Finite variation and idempotent languages and automata 2011-08-02T22:50:15.140

3 Study of free monoids of the recursive S. Eilenberg. 2011-10-08T15:22:57.197

3 Certain type of regular languages 2012-03-13T10:58:09.323

3 Algebraic structure generated by primitive graph operations 2012-04-10T08:41:11.683

3 Collatz conjecture— finite state machine transducer construction, origination? 2013-03-03T20:27:43.277

3 Turing-complete primitive blind automata 2013-03-15T10:57:40.093

3 Subsets of $\omega$-regular lanuages accepted by automata with special acceptance condition 2013-10-28T13:01:26.047

3 Exponential objects in a category of abstract automata 2014-07-10T18:30:07.157

3 Estimating the growth rate of nondeterministic finite automata 2015-03-12T14:34:07.393

3 Life. Intermediate stages 2017-02-11T22:50:17.607

3 Intersection of cone types 2017-10-26T09:20:40.920

2 Given a PDA M such that L(M) is in DCFL construct a DPDA N such that L(N) = L(M) 2011-06-06T16:38:26.867

2 Question about $\omega$-regular languages 2012-03-16T21:50:16.063

2 Varieties of rational languages and (pseudo-)varieties of finite monoids, question regarding closure property 2013-10-07T14:44:30.957

2 Proof that the $\omega$-language consisting of all words containing every finite word as a factor is not rational/regular 2013-10-20T19:59:43.163

2 Representability of sets of infinite sequences sharing common prefixes and factors (i.e. infixes) 2013-12-06T15:00:31.190

2 QBF of exponential length? 2014-05-18T18:19:09.097

2 How does "inhibitor arc" fit into fundamental equation of Hybrid Petri Nets? 2015-12-10T06:04:55.927

2 Understanding the paper: "Guarded Fixed Point Logic" 2016-09-01T09:44:50.997

2 Is there a physically realizable inductive turing machine that can solve Hilbert's $10$th problem and can it overcome Church-Turing Hypothesis? 2017-07-28T21:33:30.077

2 If a timed automaton always terminates, does there exist a trace with a maximum length? 2017-10-13T17:48:48.847

2 For synchronizing eulerian finite state machines every proper subset of states has some larger state set leads to this subset 2018-03-23T16:59:10.970

1 Dumb question about Minimization in IATLC 2010-06-30T12:40:50.150

1 example :concatenation of 2 undecidable language gives a decidable language 2012-04-29T23:52:13.987

1 Translate a buchi automaton to LTL 2012-05-15T04:17:22.870

1 Let G and H be finite index subgroups of a free group. Does GH=HG? 2013-02-01T19:47:24.893

1 Schönhage's SMM with only one instruction 2013-05-07T03:31:28.200

1 What is this structure called? 2013-09-29T01:54:02.013

1 Optimum control of a probabilistic automaton 2013-10-26T02:58:36.313

1 Question about link between non-terminals of grammars and variables of Diophantine equations 2014-05-14T09:52:56.887

1 LTL - Büchi-automaton Translation 2014-08-03T16:37:51.407

1 Relation between indexed languages (OI-macro or context-free tree) and scattered context languages 2015-07-28T16:44:34.587

1 Non-regular languages fulfilling the Pumping Lemma 2016-04-28T09:46:59.090

1 Modal logic in combination with automata theory 2016-10-29T08:26:00.830

1 What does homomorphism between languages mean to the correspoding Turing Machines? 2017-08-22T21:25:53.727

1 Minimal DFA of L* 2017-12-02T15:14:10.780

1 Sampling non-isomorphic Moore automata 2018-01-04T05:39:39.660

1 Characterization of non-Zeno functions $f:\mathbb{R}\rightarrow \{0,1\}$ 2018-01-05T21:16:12.830

1 Why can a least fixed point operator only be expanded finitely many times? 2018-01-06T11:55:08.400

1 Errors in Waksman's Solution to Cellular Automaton Firing Squad Problem? 2018-05-11T20:17:54.813

0 A Nomenclature Issue : Imprimitive Semigroup? 2010-12-15T06:53:36.473

0 Universality of blind graph rewriting 2012-04-16T21:05:55.110

0 Proof of conjecture that permutation-free automata restrict the possible states visitable from a stringset sharing prefixes and infixes 2013-11-28T19:52:44.287

0 Verification of Turing-equivalent automata 2017-04-26T14:22:04.470

0 Probabilistic timed automata transition 2018-06-25T12:13:55.177

-1 Transition Graph per alphabet? 2011-07-24T22:12:13.073

-1 prove (a+b)*=a*(ba*)* 2012-11-10T11:02:03.413

-1 An extension of the real semiring with multiple degrees of infinity 2014-01-14T22:19:00.840

-2 Deterministic Finite Automata question 2015-12-29T00:36:37.083

-2 How one can use a real math function on transaction in Hybrid Petri Net fundamental equation? 2016-02-06T06:19:06.513