S.O.S. Mathematics CyberBoard :: View Topic - Markov And Thue Systems Post Posted Fri, 31 Oct 2003 155754 GMT Post subject Markov and Thue I m somewhat familiar with Markov processes and have come across Thue systems. http://www.sosmath.com/CBB/viewtopic.php?t=3270&sid=3a604a33a7ee2c195ad68947ddc8
PlanetMath: Semi-Thue System AMS MSC, 03D03 (Mathematical logic and foundations Computability and recursion theory Thue and Post systems, etc.) http://planetmath.org/encyclopedia/SemiThueProduction.html
03Dxx 03D03 Thue and Post systems, etc. 03D05 Automata and formal grammars in connection with logical questions See also 68Q45, 68Q70, 68R15; 03D10 Turing http://www.ams.org/msc/03Dxx.html
List KWIC DDC22 510 And MSC+ZDM E-N Lexical Connection Thue and Post systems, etc. 03D03 ThueMahler equations 11D59 tight closure characteristic $p$ methods (Frobenius endomorphism) and reduction to http://www.math.unipd.it/~biblio/kwic/msc-cdd/dml2_11_60.htm
Sachgebiete Der AMS-Klassifikation: 00-09 03C95 Abstract model theory 03C99 None of the above but in this section 03Dxx Recursion theory 03D03 Thue and Post systems, etc. 03D05 Automata and formal http://www.math.fu-berlin.de/litrech/Class/ams-00-09.html
Mhb03.htm 03D03, Thue and Post systems, etc. 03D05, Automata and formal grammars in connection with logical questions See also 68Q45, 68Q70, 68R15 http://www.mi.imati.cnr.it/~alberto/mhb03.htm
MathNet-Mathematical Subject Classification 03D03, Thue and Post systems, etc. 03D05, Automata and formal grammars in connection with logical questions See also 68Q45, 68Q50, 68Q68 http://basilo.kaist.ac.kr/API/?MIval=research_msc_1991_out&class=03-XX
HeiDOK 03D03 Thue and Post systems, etc. ( 0 Dok. ) 03D05 Automata and formal grammars in connection with logical questions ( 0 Dok. http://archiv.ub.uni-heidelberg.de/volltextserver/msc_ebene3.php?zahl=03D&anzahl
Computability Theory We define Post correspondence systems and show that the problem of We define semiThue processes and show (Post, 1947) that for each e there is a http://caltechmacs117b.wordpress.com/
Theory Of Computation Qualifier --- Information I. Other equivalent systems/models the RAM model, Post systems, Thue systems and Lambda calculus. J. Oracles and Turing reducibility http://www.cs.mtu.edu/~nilufer/classes/qualifiers/2007-01-Theory/Home.html
Developments In Language Theory 2004 From Post systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata. Words Avoiding 7/3Powers and the Thue-Morse Morphism. http://www.informatik.uni-trier.de/~ley/db/conf/dlt/dlt2004.html
Book (print-only) For example in 1981 he published Thue congruences and the ChurchRosser on the field of rewriting systems was what these students and Post-docs went on http://www-groups.dcs.st-and.ac.uk/~history/Printonly/Book.html
"Word Problems For Restricted Semi-Thue Systems" By a classical result of Post and Markov, there exist finitely presented by a confluent and terminating semiThue system such that the (characteristic http://www.liafa.jussieu.fr/web9/manifsem/description_fr.php?idcongres=42
Jozef Gruska Foundations Of Computing International Thompson Buechi and Muller Automata; Finite State Control of Reactive systems Rice s Theorem; Halting Problem; Tiling Problem; Thue Problem; Post Correspondence http://www.fi.muni.cz/usr/gruska/about.html
Lecture Notes In Computer Science, 2004(3340 ) From Post systems to the Reachability Problems for Matrix Semigroups and Words Avoiding 73Powers and The Thue-Morse Morphism / Rampersad, Narad http://www.ucm.es/BUCM/compludoc/W/10501/03029743_27.htm
Computer Science Seminars And Short Courses — 2001/02 Since the work of Markov and Post it is known that there exist Thue systems with undecidable word problems. In order to locate the borderline between http://www.cs.le.ac.uk/seminars/archive/ComputerScience01-02.html
Semi-Thue System - Wikipedia, The Free Encyclopedia A SemiThue system is a special type of Post canonical system. Semi-Thue systems were developed as part of a program to add additional constructs to http://en.wikipedia.org/wiki/Semi-Thue_system
Decision Problems For Semi-Thue Systems With A Few Rules 30 Robert McNaughton, SemiThue systems with an Inhibitor, Journal of Automated Reasoning, v.26 n.4, p.409-431, May 2001. 31 31 E.L. Post, http://portal.acm.org/citation.cfm?id=1065165
Springer Online Reference Works These systems in fact coincide with local canonical Post systems. Every Thue system can be regarded as a Thue semisystem, but the converse is false. http://eom.springer.de/T/t092790.htm
COT5310 Formal Languages And Automata Theory Fall 2007 Show that given a SemiThue, S, you can produce a Post Normal System, NS, such that x = * y in S iff x = * y in NS. You must give the construction of NS http://www.cs.ucf.edu/courses/cot5310/COT5310Fall2007.html
Distributional String-Rewriting Problems The distributional word problem for Thue systems was shown to be averagecase NP-Complete Problems Previous Distributional Post Correspondence http://www.uncg.edu/mat/avg/avgnp/node13.html
2x2x2 2 Symbol Systems | Enzymind Cross sections of 3D Thue-Morse patterns, with the slice plane centered on a long diagonal of the Post new comment. Are you a spam bot? (yes or no) * http://enzymind.com/2x2x2_2_symbol_systems
NEW PROOFS OF OLD THEOREMS IN LOGIC AND FORMAL LINGUISTICS, Abstract Theorem 1 constructs, from any word problem in a semiThue system, an equivalent Post correspondence problem, showing the undecidability of the http://stinet.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0
Recursivity: Narad Rampersad's Work On Combinatorics On Words What Narad proved is the following the word t defined by Thue (and now called the Nonsquaring transformation systems start to look semi-random. http://recursed.blogspot.com/2007/11/narad-rampersads-work-on-combinatorics.html
WORD PROBLEMS FOR BIDIRECTIONAL, SINGLE-PREMISE POST SYSTEMS One class of bidirectional Post systems, the T hue systems first defined in 71, have been extensively studied. Thue systems with unsolvable word problems http://www.priorartdatabase.com/IPCOM/000128697/
Welcome To The Post's Correspondence Problem! To describe subclasses of Posts Correspondence Problem, we use PCPs to Decision problems for semiThue systems with a few rules, Proceedings, http://www.cs.ualberta.ca/~zhao/PCP/
IBM Archives: Horace W. Thue In March 1965, Thue was named vice president, plans and controls, of the IBM systems Manufacturing Division. A year later, he was appointed as general http://www-03.ibm.com/ibm/history/exhibits/builders/builders_thue.html
Bibliografía Finally published on Complex systems vol 15, number 1 (2004) pp 1 40.). . 44 Post, E. L. Recursive unsovability of a problem of Thue. http://computacion.cs.cinvestav.mx/~acaceres/docs/tesis/node115.html
Www.cyclingnews.presents Road Racing From Around The World systems 58 Cédric Fragniere (Sui) Phonak Hearing systems 59 Hansen Thue Phonak Hearing systems 69 Anton Chantyr (Rus) Team CoastPost Swiss Team 70 http://www.cyclingnews.com/results/2000/feb00/gpumag003.shtml
Automata And Formal Languages the set of finite languages in SL is enumerable Post Correspondence Problem G and some right linear G unrestricted grammars (aka semiThue or type 0 or http://carlstrom.com/stanford/comps/Automata-and-Formal-Languages.txt
GeorgeSzpiro.com As a highschool student Thue showed the first signs of a superior ability by . and an oscillator systems with unparalleled stability had to be built. http://www.georgeszpiro.com/index.asp?page=kepler/chapter04.htm
Universality Emil Post, 1920s, String replacement rules designed to prove SemiThue systems Axel Thue, 1910, Apply string replacement rules in arbitrary order. http://www.cs.princeton.edu/introcs/75universality/
JSTOR Recursive Unsolvability Of A Problem Of Thue. Post s proof is in three parts. (1) He first considers a semiThue system, in which only the replacements of A ~ by B~ are allowed. http://links.jstor.org/sici?sici=0022-4812(194709)12:3<90:RUOAPO>2.0.CO;2-3
IngentaConnect Semi-Thue Systems With An Inhibitor A semiThue system with an inhibitor is one having a special symbol, called an inhibitor, that appears on the right side of every rule but does not appear http://www.ingentaconnect.com/content/klu/jars/2001/00000026/00000004/00207710
Computability Complexity Logic Book Simulation of 37 other explication concepts modular machines, 2register machines, Thue systems, Markov algorithms, ordered vector addition systems (Petri http://www.di.unipi.it/~boerger/cclbookcontents.html
"Thue" - Topic Profile :: BoardReader JM Yeah, that was me being dumb befoer Aeson/Thue gave me an edumacation on components. What do you think about what I have listed in Post 14? http://boardreader.com/tp/Thue.html
0 Top The TOP Concept In The Hierarchy. 1 Adverbial Modification 169 abstraction 17 Post algebra 170 application 171 conversion 172 lambda . 328 theory of numerations 329 Thue system 33 unicorn 330 undecidability 331 http://staff.science.uva.nl/~caterina/LoLaLi/soft/ch-data/gloss.txt
2001 - Freeciv.org The noteworthy difference from the second beta (1.11.8) is that a bug that caused it to not compile on some operating systems has been fixed. Thue Janus http://freeciv.wikia.com/wiki/2001
Freeciv-dev May 2001 FreecivDev Re Freeciv Re Trouble Staring CIV, Thue, 1240 Re inactive game for days (see game number) (PR 763), Reinier Post, 1557 http://lists.complete.org/freeciv-dev@freeciv.org/2001/05/index.html.gz
Games.freeciv.cvs (date) Re Thue Make Leonardo s Workshop choose a random unit , Reinier Post, 1738; Re Thue Layer view; you can choose not to display some , Erik Sigra, http://osdir.com/ml/games.freeciv.cvs/2001-02/index.html
Turing Complete@Everything2.com Examples of Turing complete formal systems include the following (along with the These various Turing complete formal systems have become the basis for http://everything2.com/index.pl?node=Turing complete
Pushing The Limits Of Game AI Technology — AiGameDev.com The system uses principles from developmental psychology to restrict the complexity (229 Kb) David Thue, Vadim Bulitko, Marcia Spetch, Eric Wasylishen http://aigamedev.com/coverage/aiide-2007-papers
