Losing recognizability

DOI10.1016/J.TCS.2007.03.050MaRDI QIDQ2373716zbMATH OpenOpenAlexFDO

Authors Sándor Vágvölgyi

Publication date 16 July 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.03.050

zbMATH Keywords

recognizability preservingrewrite systemssets of descendantstree automata

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Conformality lost
• Identification and Lack of Identification
• Underidentification?
• Identity reconsidered
• Identities in search of identity
• A grasp of identity
• Identity and indiscernibility
• scientific article; zbMATH DE number 3219066

Cites work

• A property of left-linear rewrite systems preserving recognizability
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• scientific article; zbMATH DE number 1615242 (Why is no real title available?)
• scientific article; zbMATH DE number 176501 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 2090067 (Why is no real title available?)
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• Some undecidability results concerning the property of preserving regularity
• Tree generating regular systems

This page was built for publication: Losing recognizability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373716)